A nonmonotone Broyden method for unconstrained optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3687182 (Why is no real title available?)
- scientific article; zbMATH DE number 1552015 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- CUTE
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- Local convergence analysis for partitioned quasi-Newton updates
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Optimal conditioning in the convex class of rank two updates
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- Quasi-Newton Methods, Motivation and Theory
- Variable metric methods of minimisation
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
This page was built for publication: A nonmonotone Broyden method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778682)
