A modular system of algorithms for unconstrained minimization

We describe a new package, UNCMIN, for finding a local minimizer of a real valued function of more than one variable. The novel feature of UNCMIN is that it is a modular system of algorithms, containing three different step selection strategies (line search, dogleg, and optimal step) that may be combined with either analytic or finite difference gradient evaluation and with either analytic, finite difference, or BFGS Hessian approximation. We present the results of a comparison of the three step selection strategies on the problems in More, Garbow, and Hillstrom in two separate cases: using finite difference gradients and Hessians, and using finite difference gradients with BFGS Hessian approximations. We also describe a second package, REVMIN, that uses optimization algorithms identical to UNCMIN but obtains values of user-supplied functions by reverse communication.

[1]  Richard W. Hamming,et al.  Introduction to Applied Numerical Analysis. , 1971 .

[2]  Barbara G. Ryder,et al.  The pfort verifier , 1974, Softw. Pract. Exp..

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

[4]  David F. Shanno,et al.  Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4] , 1976, TOMS.

[5]  D. Goldfarb.  Factorized variable metric methods for unconstrained optimization , 1976 .

[6]  Leon J. Osterweil,et al.  Dave—a validation error detection and documentation system for fortran programs , 1976, Softw. Pract. Exp..

[7]  Jorge J. Moré,et al.  The Levenberg-Marquardt algo-rithm: Implementation and theory , 1977 .

[8]  J. J. Moré,et al.  Levenberg--Marquardt algorithm: implementation and theory , 1977 .

[9]  Philip E. Gill,et al.  The Design and Structure of a Fortran Program Library for Optimization , 1979, TOMS.

[10]  J. Dennis,et al.  Two new unconstrained optimization algorithms which use function and gradient values , 1979 .

[11]  David M. author-Gay.  Computing Optimal Locally Constrained Steps , 1981 .

[12]  John E. Dennis,et al.  An Adaptive Nonlinear Least-Squares Algorithm , 1977, TOMS.

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

[14]  Richard H. Byrd,et al.  A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. , 1985 .

[15]  D. Sorensen.  Newton's method with a model trust region modification , 1982 .

[16]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[17]  M GayDavid,et al.  Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach , 1983 .

[18]  Jerrold L. Wagener,et al.  Status of work toward revision of programming language Fortran , 1984, FORF.

[19]  J. Wagener.  Status of work toward revision of programming language Fortran , 1984, FORF.