Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization

DOI10.1007/S10852-010-9143-ZzbMath1234.65031OpenAlexW2091213320MaRDI QIDQ662127

Anqi Wang, Zhensheng Yu

Publication date: 21 February 2012

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-010-9143-z

zbMATH Keywords

global convergencememory modeltrust regionnonmonotone technique

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Nonmonotonic trust region algorithm
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• On the global convergence of trust region algorithms for unconstrained minimization
• CUTE
• Trust Region Methods
• A Nonmonotone Line Search Technique for Newton’s Method
• A nonmonotone trust region method for nonlinear programming with simple bound constraints

This page was built for publication: Global convergence of a nonmonotone trust region algorithm with memory for unconstrained optimization