Starting-point strategies for an infeasible potential reduction method

We present two strategies for choosing a “hot” starting-point in the context of an infeasible potential reduction (PR) method for convex quadratic programming. The basic idea of both strategies is to select a preliminary point and to suitably scale it in order to obtain a starting point such that its nonnegative entries are sufficiently bounded away from zero, and the ratio between the duality gap and a suitable measure of the infeasibility is small. One of the two strategies is naturally suggested by the convergence theory of the PR method; the other has been devised to reduce the initial values of the duality gap and the infeasibility measure, with the objective of decreasing the number of PR iterations. Numerical experiments show that the second strategy generally performs better than the first, and both outperform a starting-point strategy based on the affine-scaling step.

[1]  Daniela di Serafino,et al.  DIPARTIMENTO DI MATEMATICA , 2008 .

[2]  Sonia Cafieri,et al.  ON THE USE OF AN APPROXIMATE CONSTRAINT PRECONDITIONER IN A POTENTIAL REDUCTION ALGORITHM FOR QUADRATIC PROGRAMMING , 2007 .

[3]  G. Toraldo,et al.  Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints , 2006 .

[4]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[5]  G. Toraldo,et al.  Convergence Analysis of an Inexact Potential Reduction Method for Convex Quadratic Programming , 2007 .

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

[7]  Jorge Nocedal,et al.  A starting point strategy for nonlinear interior methods , 2004, Appl. Math. Lett..

[8]  Sonia Cafieri,et al.  On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems , 2007, Comput. Optim. Appl..

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

[10]  Shinji Mizuno,et al.  Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming , 1995, SIAM J. Optim..

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

[12]  Sonia Cafieri,et al.  Stopping criteria for inner iterations in inexact potential reduction methods: a computational study , 2007, Comput. Optim. Appl..

[13]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

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

[15]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .