Computational experience with penalty-barrier methods for nonlinear programming

It was recently shown that modified barrier methods are not only theoretically but also computationally superior to classic barrier methods when applied to general nonlinear problems. In this paper, a penalty-barrier function is presented that was designed to overcome particular problems associated with modified log-barrier functions. A quadratic extrapolation of logarithmic terms as well as handling simple bounds separately are utilized. The resulting penalty-barrier method is outlined and compared to previous methods. The conclusion drawn from the computational tests is that the revised method exhibits superior performance on the test set of this study and consequently holds promise as a viable technique for general nonlinear programming.

[1]  David F. Shanno,et al.  Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming , 1994 .

[2]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[3]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

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

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

[6]  W. Murray,et al.  Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions , 1971 .

[7]  J. J. Moré,et al.  Newton's Method , 1982 .

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

[9]  Philip E. Gill,et al.  Newton-type methods for unconstrained and linearly constrained optimization , 1974, Math. Program..

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

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

[12]  David F. Shanno,et al.  Numerical experience with sequential quadratic programming algorithms for equality constrained nonlinear programming , 1989, TOMS.

[13]  Ron S. Dembo,et al.  A set of geometric programming test problems and their solutions , 1976, Math. Program..

[14]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[15]  S. Nash,et al.  A Numerical Comparison of Barrier and Modified Barrier Methods for Large-Scale Bound-Constrained Optimization , 1994 .