Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
From MaRDI portal
Publication:953368
DOI10.1016/j.cam.2007.12.011zbMath1191.90076OpenAlexW2123778266MaRDI QIDQ953368
Publication date: 20 November 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.12.011
Related Items (12)
A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A memory gradient method based on the nonmonotone technique ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ New cautious BFGS algorithm based on modified Armijo-type line search ⋮ Comments on: ``A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization ⋮ A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations ⋮ A globally convergent BFGS method with nonmonotone line search for non-convex minimization ⋮ Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach ⋮ A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
Cites Work
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- The BFGS method with exact line searches fails for non-convex objective functions
- Convergence of the nonmonotone Perry and Shanno method for optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Testing Unconstrained Optimization Software
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Convergence Properties of the BFGS Algoritm
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- A modified BFGS method and its global convergence in nonconvex minimization
- On the nonmonotone line search
This page was built for publication: Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
