A modular system of algorithms for unconstrained minimization
- 1 December 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 11 (4), 419-440
- https://doi.org/10.1145/6187.6192
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region ApproachACM Transactions on Mathematical Software, 1983
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- An Adaptive Nonlinear Least-Squares AlgorithmACM Transactions on Mathematical Software, 1981
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Testing Unconstrained Optimization SoftwareACM Transactions on Mathematical Software, 1981
- The Design and Structure of a Fortran Program Library for OptimizationACM Transactions on Mathematical Software, 1979
- Two new unconstrained optimization algorithms which use function and gradient valuesJournal of Optimization Theory and Applications, 1979
- Dave—a validation error detection and documentation system for fortran programsSoftware: Practice and Experience, 1976
- Factorized variable metric methods for unconstrained optimizationMathematics of Computation, 1976
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974