Non monotone algorithms for unconstrained minimization: upper bounds on function values

DOI10.1007/0-387-33006-2_9MaRDI QIDQ3004455zbMATH OpenOpenAlexFDO

Authors Ubaldo M. García-Palomares

Publication date 1 June 2011

Published in IFIP International Federation for Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-33006-2_9

zbMATH Keywords

lineal searchnon monotonetrust region

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• The non-monotone conic algorithm
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
• Nonmonotone algorithms for pattern search methods

Cited in

(2)

• Nonmonotone algorithms for pattern search methods
• Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization

This page was built for publication: Non monotone algorithms for unconstrained minimization: upper bounds on function values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004455)