On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization

MaRDI QIDQ4612299zbMATH OpenFDO

Authors Chaohui Liang, Fei Wang, Li Zhang

Publication date 31 January 2019

Full work available at URL https://camo.ici.ro/journal/vol16/v16a19.pdf

zbMATH Keywords

global complexity boundMFR methodMHS method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A nonlinear conjugate gradient method and its global convergence analysis
• A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound
• On the strong convergence of a modified Hestenes-Stiefel method for nonconvex optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• Global convergence of a nonlinear conjugate gradient method

Cited in

(2)

• A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound
• On a global complexity bound of the Levenberg-marquardt method

This page was built for publication: On the global complexity bounds of two nonlinear conjugate gradient methods for nonconvex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612299)