A globally convergent BFGS method for nonconvex minimization without line searches

DOI10.1080/10556780500065499zbMath1127.90416OpenAlexW2036558771MaRDI QIDQ3369523

Zhang Li

Publication date: 2 February 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500065499

zbMATH Keywords

global convergencenonconvex minimizationBFGS methodsuperlinear convergence

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55)

Related Items

A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A Modified Non-Monotone BFGS Method for Non-Convex Unconstrained Optimization ⋮ Global convergence of a modified limited memory BFGS method for non-convex minimization ⋮ A globally convergent BFGS method with nonmonotone line search for non-convex minimization

Cites Work

• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
• On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• 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
• Testing Unconstrained Optimization Software
• Convergence Properties of the BFGS Algoritm
• On the Convergence of the Variable Metric Algorithm
• A modified BFGS method and its global convergence in nonconvex minimization
• Global convergence of conjugate gradient methods without line search