|
|||||
|
|
Trajectory-following methods for large-scale degenerate convex quadratic programming |
|
| Authors: | Nicholas I M Gould Dominique Orban Daniel P Robinson |
| Institution: | 1. Scientific Computing Department, Rutherford Appleton Laboratory, Chilton, Oxfordshire, OX11 0QX, UK 2. GERAD and Mathematics and Industrial Engineering Department, école Polytechnique de Montréal, C. P. 6079, Succ. Centre Ville, Montreal, QC, H3C 3A7, Canada 3. Department of Applied Mathematics and Statistics, Johns Hopkins University, 100 Whitehead Hall, 3400 N. Charles Street, Baltimore, MD, 21218, USA |
| Abstract: | 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |