A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound

zbMATH Open1461.65191MaRDI QIDQ4990876FDOQ4990876

Authors: Li Zhang, Hui Tang 

Publication date: 1 June 2021

Full work available at URL: http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n4p693.pdf

Recommendations

• Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
• A globally convergent BFGS method for nonconvex minimization without line searches
• On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• A globally convergent BFGS method with nonmonotone line search for non-convex minimization

zbMATH Keywords

BFGS methodline searchthe global complexity bound

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited In (8)

• Convergence analysis of an improved BFGS method and its application in the Muskingum model
• A class of line search-type methods for nonsmooth convex regularized minimization
• 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 modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
• On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization
• A globally convergent BFGS method for symmetric nonlinear equations
• The projection technique for two open problems of unconstrained optimization problems

This page was built for publication: A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990876)