A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization

Summary. Inequality constrained minimization problems are often solved by considering a sequence of parameterized barrier functions. Each barrier function is approximately minimized and the relevant parameters subsequently adjusted. It is common for the estimated solution to one barrier function problem to be used as a starting estimate for the next. However, this has unfortunate repercussions for the standard Newton-like methods applied to the barrier subproblem. In this note, we consider a class of alternative Newton methods which attempt to avoid such difficulties. Such schemes have already proved of use in the Harwell Subroutine Library quadratic programming codes {\tt VE14} and {\tt VE19}.

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

[2]  Leon S. Lasdon,et al.  An efficient one—dimensional search procedure for barrier functions , 1971, Math. Program..

[3]  M. H. Wright.  Numerical methods for nonlinearly constrained optimization , 1976 .

[4]  W. Murray,et al.  Projected Lagrangian Methods Based on the Trajectories of Penalty and Barrier Functions. , 1978 .

[5]  Michael R. Osborne,et al.  A modified barrier function method with improved rate of convergence for degenerate problems , 1980, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[6]  Iain S. Duff,et al.  MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations , 1982 .

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

[8]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

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

[10]  N. Gould.  On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions , 1986 .

[11]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[12]  J. Stoer,et al.  An implementation of the method of analytic centers , 1988 .

[13]  N. Gould.  On the convegence of a sequential penalty function method for constrained minimization , 1989 .

[14]  Robert M. Freund,et al.  Theoretical efficiency of a shifted-barrier-function algorithm for linear programming , 1991 .

[15]  Margaret H. Wright,et al.  Interior methods for constrained optimization , 1992, Acta Numerica.

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

[17]  Michael A. Saunders,et al.  Preconditioners for Indefinite Systems Arising in Optimization , 1992, SIAM J. Matrix Anal. Appl..

[18]  Stephen G. Nash,et al.  A Barrier Method for Large-Scale Constrained Optimization , 1993, INFORMS J. Comput..

[19]  Walter Murray,et al.  Line Search Procedures for the Logarithmic Barrier Function , 1994, SIAM J. Optim..

[20]  Margaret H. Wright,et al.  Why a Pure Primal Newton Barrier Step May be Infeasible , 1995, SIAM J. Optim..

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