Projects per year
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.
Original language | English |
---|---|
Pages (from-to) | 725-739 |
Number of pages | 15 |
Journal | SIAM Journal on Scientific and Statiscal Computing |
Volume | 17 |
Issue number | 3 |
Publication status | Published - 1996 |
Fingerprint
Dive into the research topics of 'An assessment of non-monotone linesearch techniques for unconstrained optimization'. Together they form a unique fingerprint.Projects
- 1 Active