The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
From MaRDI portal
Publication:625664
DOI10.1007/S11424-010-7180-3zbMATH Open1209.90321OpenAlexW2050511877MaRDI QIDQ625664FDOQ625664
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
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
- Title not available (Why is that?)
- A modified BFGS method and its global convergence in nonconvex minimization
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Convergence Properties of the BFGS Algoritm
- Global convergence of conjugate gradient methods without line search
- Quasi-Newton Algorithms with Updates from the Preconvex Part of Broyden's Family
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Title not available (Why is that?)
- On the Convergence of the Variable Metric Algorithm
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions
Cited In (4)
Uses Software
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)
