Global convergence properties of the modified BFGS method associating with general line search model
From MaRDI portal
Publication:1885078
DOI10.1007/BF02936161zbMath1065.65077OpenAlexW1993453088MaRDI QIDQ1885078
Publication date: 28 October 2004
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02936161
global convergencenumerical experimentsapproximate Hessiannon-convex programmingBroyden-Fletcher-Goldfarb-Shanno methodBFGS-type methodgeneral line search
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (6)
Global convergence properties of two modified BFGS-type methods ⋮ Global convergence of a modified BFGS-type method for unconstrained non-convex minimization ⋮ A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations ⋮ An adaptive approach of conic trust-region method for unconstrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- An ABS algorithm for solving singular nonlinear systems with rank defects.
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Quasi-Newton Methods, Motivation and Theory
- Variable metric methods of minimisation
This page was built for publication: Global convergence properties of the modified BFGS method associating with general line search model