1.Business School,Shanghai University for Science and Technology,Shanghai,China
Abstract:
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 method is valid. The computational complexity analysis of the algorithm is given.