A primal-dual interior-point algorithm for quadratic programming

In this paper we propose a primal-dual interior-point method for large, sparse, quadratic programming problems. The method is based on a reduction presented by Gonzalez-Lima, Wei, and Wolkowicz [14] in order to solve the linear systems arising in the primal-dual methods for linear programming. The main features of this reduction is that it is well defined at the solution set and it preserves sparsity. These properties add robustness and stability to the algorithm and very accurate solutions can be obtained. We describe the method and we consider different reductions using the same framework. We discuss the relationship of our proposals and the one used in the LOQO code. We compare and study the different approaches by performing numerical experimentation using problems from the Maros and Meszaros collection. We also include a brief discussion on the meaning and effect of ill-conditioning when solving linear systems.

[1]  C. Mészáros,et al.  A repository of convex quadratic programming problems , 1999 .

[2]  Stephen J. Wright.  A path-following interior-point algorithm for linear and quadratic problems , 1993 .

[3]  Timothy A. Davis,et al.  An Unsymmetric-pattern Multifrontal Method for Sparse Lu Factorization , 1993 .

[4]  D. Sorensen,et al.  A new class of preconditioners for large-scale linear systems from interior point methods for linear programming , 2005 .

[5]  István Maros,et al.  The role of the augmented system in interior point methods , 1998, Eur. J. Oper. Res..

[6]  C. Mészáros.  The BPMPD interior point solver for convex quadratic problems , 1999 .

[7]  Robert J. Vanderbei,et al.  Symmetric Quasidefinite Matrices , 1995, SIAM J. Optim..

[8]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[9]  Luca Bergamaschi,et al.  Preconditioning Indefinite Systems in Interior Point Methods for Optimization , 2004, Comput. Optim. Appl..

[10]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[11]  Jacek Gondzio,et al.  An interior point solver for smooth convex optimization with an application to environmental-energy-economic models , 2000 .

[12]  Joseph W. H. Liu,et al.  Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.

[13]  R. Vanderbei.  Symmetric Quasi-Definite Matrices , 2006 .

[14]  Stephen J. Wright.  Stability of Augmented System Factorizations in Interior-Point Methods , 1997, SIAM J. Matrix Anal. Appl..

[15]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[16]  Patrick R. Amestoy,et al.  An Approximate Minimum Degree Ordering Algorithm , 1996, SIAM J. Matrix Anal. Appl..

[17]  Joseph R. Shinnerl,et al.  Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization , 1996, SIAM J. Matrix Anal. Appl..

[18]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[19]  Stephen J. Wright,et al.  Object-oriented software for quadratic programming , 2003, TOMS.

[20]  Stephen J. Wright.  Stability of Linear Equations Solvers in Interior-Point Methods , 1995, SIAM J. Matrix Anal. Appl..

[21]  Timothy A. Davis,et al.  Algorithm 837: AMD, an approximate minimum degree ordering algorithm , 2004, TOMS.

[22]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[23]  R. Vanderbei.  LOQO:an interior point code for quadratic programming , 1999 .

[24]  Robert J. Vanderbei,et al.  Symmetric indefinite systems for interior point methods , 1993, Math. Program..

[25]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

[26]  Jacek Gondzio,et al.  Parallel interior-point solver for structured quadratic programs: Application to financial planning problems , 2007, Ann. Oper. Res..

[27]  Oleksandr Romanko,et al.  Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors , 2007, Algorithmic Oper. Res..

[28]  J. Gondzio.  HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method , 1995 .

[29]  Jacek Gondzio,et al.  Solving non-linear portfolio optimization problems with the primal-dual interior point method , 2007, Eur. J. Oper. Res..