Answers are grounded in this paper and cite their sources.
In this paper, we describe a new primal-dual path-following method to solve a convex quadratic program (QP). The derived algorithm is based on new techniques for finding a new class of search directions similar to the ones developed in a recent paper by Darvay for linear programs. We prove that the short-update algorithm finds an epsilon-solution of (QP) in a polynomial time.
No takes yet. Share an insight, caveat, or question.
Mohamed Achache (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: