A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
DOI10.1007/S12190-008-0117-5zbMATH Open1170.65048OpenAlexW2010088179MaRDI QIDQ949372FDOQ949372
Authors: Qiang Guo, Danhong Wang, Jian-guo Liu 
Publication date: 21 October 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0117-5
Recommendations
- A modified BFGS method and its global convergence in nonconvex minimization
- scientific article; zbMATH DE number 5196186
- Convergence analysis of a modified BFGS method on convex minimizations
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
global convergenceunconstrained optimizationline searchsuper-linear convergenceBroyden-Fletcher-Goldfarb-Shanno (BFGS) methodmodified BFGS
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Convergence Conditions for Ascent Methods
- Quasi-Newton Methods, Motivation and Theory
- Title not available (Why is that?)
- Minimization of functions having Lipschitz continuous first partial derivatives
- The BFGS method with exact line searches fails for non-convex objective functions
- 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
- Variable metric methods of minimisation
- An ABS algorithm for solving singular nonlinear systems with rank defects.
- Title not available (Why is that?)
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Convergence of the Variable Metric Algorithm
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- Global convergence properties of the modified BFGS method associating with general line search model
- An effective algorithm for minimization
Cited In (13)
- Smoothing method for minimizing the sum of therlargest functions
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A modified BFGS algorithm based on a hybrid secant equation
- The BFGS method with exact line searches fails for non-convex objective functions
- Block BFGS methods
- A modified two-point stepsize gradient algorithm for unconstrained minimization
- Title not available (Why is that?)
- Global convergence properties of the modified BFGS method associating with general line search model
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
- A modified scaling BFGS method for nonconvex minimization
- Two effective hybrid conjugate gradient algorithms based on modified BFGS updates
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
This page was built for publication: A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949372)
