The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
From MaRDI portal
Publication:2181683
DOI10.1007/s11075-019-00779-7zbMath1443.90280OpenAlexW2960461445WikidataQ127482922 ScholiaQ127482922MaRDI QIDQ2181683
Publication date: 19 May 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00779-7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A double parameter scaled BFGS method for unconstrained optimization
- Local convergence analysis for partitioned quasi-Newton updates
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- The global convergence of a modified BFGS method for nonconvex functions
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- Convergence Properties of the BFGS Algoritm
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- The conjugate gradient method in extremal problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique