The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems

DOI10.1007/S11424-010-7180-3MaRDI QIDQ625664zbMATH OpenOpenAlexFDO

Authors Liying Liu, Zengxin Wei, Xiao Ping Wu

Publication date 25 February 2011

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-010-7180-3

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A globally convergent BFGS method for nonconvex minimization without line searches
• scientific article; zbMATH DE number 5196186
• Convergence analysis of a modified BFGS method on convex minimizations
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Modified limited memory BFGS method with nonmonotone line search for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• scientific article; zbMATH DE number 238304 (Why is no real title available?)
• A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
• A modified BFGS method and its global convergence in nonconvex minimization
• Convergence Properties of the BFGS Algoritm
• Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
• Global convergence of conjugate gradient methods without line search
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
• On the Convergence of the Variable Metric Algorithm
• On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
• Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
• The superlinear convergence of a modified BFGS-type method for unconstrained optimization
• Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions

Cited in

(4)

• scientific article; zbMATH DE number 1421678 (Why is no real title available?)
• A family of quasi-Newton methods for unconstrained optimization problems
• Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
• scientific article; zbMATH DE number 5196186 (Why is no real title available?)

Describes a project that uses

Uses Software

• minpack

This page was built for publication: The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems

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