A modified non-monotone BFGS method for non-convex unconstrained optimization
From MaRDI portal
Recommendations
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
- A modified BFGS method and its global convergence in nonconvex minimization
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
Cites work
- A globally convergent BFGS method for nonconvex minimization without line searches
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Algorithm 851
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
- Convergence Properties of the BFGS Algoritm
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- On the limited memory BFGS method for large scale optimization
- On the nonmonotone line search
- Quasi-Newton Methods, Motivation and Theory
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The BFGS method with exact line searches fails for non-convex objective functions
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
Cited in
(10)- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
- scientific article; zbMATH DE number 5196186 (Why is no real title available?)
- A modified scaling BFGS method for nonconvex minimization
- A modified BFGS method and its global convergence in nonconvex minimization
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
This page was built for publication: A modified non-monotone BFGS method for non-convex unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931168)