G-2011-50
Trajectory-Following Methods for Large-Scale Degenerate Convex Quadratic Programming
, et référence BibTeX
We consider a class of infeasible, path-following methods for convex quadratric programming. Our methods are designed to be effective for solving both nondegerate and degenerate problems, where degeneracy is understood to mean the failure of strict complementarity at a solution. Global convergence and a polynomial bound on the number of iterations required is given. An implementation, CQP, is available as part of GALAHAD. We illustrate the advantages of our approach on the CUTEr and Maros-Meszaros test sets.
Paru en octobre 2011 , 39 pages
Axe de recherche
Application de recherche
Publication
jan. 2013
Trajectory-following methods for large-scale degenerate convex quadratic programming
, et
Mathematical Programming, Serie C, 5(2), 113–142, 2013
référence BibTeX