An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- 1 May 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 17 (3) , 725-739
- https://doi.org/10.1137/s106482759427021x
Abstract
The purpose of this paper is to discuss the potential of nonmonotone techniques for enforcing convergence of unconstrained minimization algorithms from starting points distant from the solution. Linesearch-based algorithms are considered for both small and large problems, and extensive numerical experiments show that this potential is sometimes considerable. A new variant is introduced in order to limit some of the identified drawbacks of the existing techniques. This variant is again numerically tested and appears to be competitive. Finally, the impact of preconditioning on the considered methods is examined.Keywords
This publication has 19 references indexed in Scilit:
- CUTEACM Transactions on Mathematical Software, 1995
- On the Behavior of Broyden’s Class of Quasi-Newton MethodsSIAM Journal on Optimization, 1992
- Preconditioners for Indefinite Systems Arising in OptimizationSIAM Journal on Matrix Analysis and Applications, 1992
- LancelotPublished by Springer Nature ,1992
- Convergence properties of trust region methods for linear and convex constraintsMathematical Programming, 1990
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1989
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Local convergence analysis for partitioned quasi-Newton updatesNumerische Mathematik, 1982
- The watchdog technique for forcing convergence in algorithms for constrained optimizationPublished by Springer Nature ,1982
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974