A nonmonotone Broyden method for unconstrained optimization
From MaRDI portal
Publication:2778682
DOI10.1080/10556780108805815zbMath1099.90578OpenAlexW2094720111MaRDI QIDQ2778682
Lili Jing, Lixing Han, Guang-Hui Liu
Publication date: 2001
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780108805815
Convex programming (90C25) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- Local convergence analysis for partitioned quasi-Newton updates
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Quasi-Newton Methods, Motivation and Theory
- Optimal conditioning in the convex class of rank two updates
- CUTE
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Variable metric methods of minimisation
This page was built for publication: A nonmonotone Broyden method for unconstrained optimization
