Tian, Da - In: Computational Optimization and Applications 61 (2015) 1, pp. 51-78
<Para ID="Par1">In this paper an exterior point polynomial time algorithm for convex quadratic programming problems is proposed. We convert a convex quadratic program into an unconstrained convex program problem with a self-concordant objective function. We show that, only with duality, the Path-following...</para>