Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming

The paper presents an algorithm for solving nonlinear programming problems. The algorithm is based on the combination of interior and exterior point methods. The latter is also known as the primal-dual nonlinear rescaling method. The paper shows that in certain cases when the interior point method (IPM) fails to achieve the solution with the high level of accuracy, the use of the exterior point method (EPM) can remedy this situation. The result is demonstrated by solving problems from COPS and CUTE problem sets using nonlinear programming solver LOQO that is modified to include the exterior point method subroutine.

[1]  Marc Teboulle,et al.  Nonlinear rescaling and proximal-like methods in convex optimization , 1997, Math. Program..

[2]  Roy E. Marsten,et al.  Feature Article - Interior Point Methods for Linear Programming: Computational State of the Art , 1994, INFORMS J. Comput..

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

[4]  Robert J. Vanderbei,et al.  Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions , 2002, Comput. Optim. Appl..

[5]  Nicholas I. M. Gould,et al.  CUTE: constrained and unconstrained testing environment , 1995, TOMS.

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

[7]  Jorge J. Moré,et al.  COPS: Large-scale nonlinearly constrained optimization problems , 2000 .

[8]  Roman A. Polyak,et al.  Nonlinear rescaling vs. smoothing technique in convex optimization , 2002, Math. Program..

[9]  James Renegar,et al.  Unified complexity analysis for Newton LP methods , 1992, Math. Program..

[10]  Roman A. Polyak,et al.  Modified barrier functions (theory and methods) , 1992, Math. Program..

[11]  Igor Griva,et al.  Primal-Dual Nonlinear Rescaling Method for Convex Optimization , 2004 .

[12]  J. Sobieszczanski-Sobieski,et al.  The Newton log-sigmoid method in constrained optimization , 1998 .

[13]  Igor Griva,et al.  Primal-dual nonlinear rescaling method with dynamic scaling parameter update , 2006, Math. Program..

[14]  Michael A. Saunders,et al.  On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..

[15]  R. Vanderbei.  LOQO user's manual — version 3.10 , 1999 .

[16]  D. Bertsekas,et al.  Multiplier methods for convex programming , 1973, CDC 1973.

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

[18]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[19]  N. Megiddo.  Pathways to the optimal set in linear programming , 1989 .

[20]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..