Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
From MaRDI portal
Publication:953368
DOI10.1016/J.CAM.2007.12.011zbMATH Open1191.90076OpenAlexW2123778266MaRDI QIDQ953368FDOQ953368
Authors: Weijun Zhou, Li Zhang 
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
Recommendations
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- A new proof for the global convergence of the BFGS method for nonconvex unconstrained minimization problems
- scientific article; zbMATH DE number 1960955
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- Globally convergence of nonlinear conjugate gradient method for unconstrained optimization
- scientific article; zbMATH DE number 1293291
Cites Work
- Testing Unconstrained Optimization Software
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A modified BFGS method and its global convergence in nonconvex minimization
- The BFGS method with exact line searches fails for non-convex objective functions
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Convergence Properties of the BFGS Algoritm
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- On the nonmonotone line search
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- A nonmonotone conjugate gradient algorithm for unconstrained optimization
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- A class of nonmonotone conjugate gradient methods for unconstrained optimization
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Convergence of the nonmonotone Perry and Shanno method for optimization
Cited In (19)
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A note on ``A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- A memory gradient method based on the nonmonotone technique
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- The global convergence of the non-quasi-Newton methods with non-monotone line search
- Comments on: ``A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
- Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
- Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
- A modified non-monotone BFGS method for non-convex unconstrained optimization
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- A globally convergent BFGS method for nonconvex minimization without line searches
- New cautious BFGS algorithm based on modified Armijo-type line search
- New BFGS method for unconstrained optimization problem based on modified armijo line search
- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
Uses Software
This page was built for publication: Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953368)
