Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
DOI10.1007/BF02832321zbMATH Open1128.65040OpenAlexW2067207573MaRDI QIDQ2454986FDOQ2454986
Authors: Qiang Guo, Jian-guo Liu 
Publication date: 22 October 2007
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02832321
Recommendations
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- Global convergence properties of the modified BFGS method associating with general line search model
- A globally convergent BFGS method with nonmonotone line search for non-convex minimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
global convergencenonconvex programmingBroyden-Fletcher-Goldfarb-Shanno (BFGS) algorithmquasi-Newton iterationline search model
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
- Minimization of functions having Lipschitz continuous first partial derivatives
- The BFGS method with exact line searches fails for non-convex objective functions
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Variable metric methods of minimisation
- An ABS algorithm for solving singular nonlinear systems with rank defects.
- Title not available (Why is that?)
- Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung
- An SQP-type method and its application in stochastic programs
- Global convergence properties of the modified BFGS method associating with general line search model
- An effective algorithm for minimization
Cited In (21)
- Title not available (Why is that?)
- The global convergence of a modified BFGS method for nonconvex functions
- The global convergence of a modified BFGS method under inexact line search for nonconvex functions
- Adaptive matrix algebras in unconstrained minimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A Newton-like trust region method for large-scale unconstrained nonconvex minimization
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- Global convergence properties of two modified BFGS-type methods
- A class of modified Broyden methods for solving nonconvex minimization problems
- A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization
- A modified BFGS-trust region method for nonconvex minimization
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- A modified nonmonotone BFGS algorithm for solving smooth nonlinear equations
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Derivative-free simulated annealing and deflecting function technique for global optimization
- Global convergence of nonsingular Broyden's method for solving unconstrained optimizations
This page was built for publication: Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454986)
