Equivalence of some quadratic programming algorithms

From MaRDI portal





It is shown that the quadratic programming algorithms of Fletcher, Gill and Murray, Best and Ritter, and van de Panne and Whinston/Dantzig are special cases of a general algorithm for the solution of a convex (but not strictly convex) quadratic programming problem. The various algorithms are shown to differ only in the manner in which they solve the linear equations expressing the Kuhn-Tucker system. As a consequence all algorithms are shown to generate an identical sequence of points when starting from the same initial point. The paper extends the equivalence results of Goldfarb and Djang for the strictly positive definite case to the semi-definite quadratic programming problems.



Cites work


Cited in
(36)








This page was built for publication: Equivalence of some quadratic programming algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343781)