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-3zbMath1209.90321OpenAlexW2050511877MaRDI QIDQ625664
Liying Liu, Xiao-ping Wu, Zeng-xin Wei
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
Related Items (2)
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- 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
- 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
This page was built for publication: The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
