Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

DOI10.1186/1029-242X-2011-57zbMath1276.90054WikidataQ59268578 ScholiaQ59268578MaRDI QIDQ357379

Shaoheng Wang, Jin-Kui Liu

Publication date: 30 July 2013

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2011-57

zbMATH Keywords

global convergence; line search

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

65H10: Numerical computation of solutions to systems of equations

Cites Work

• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Scaled conjugate gradient algorithms for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Another nonlinear conjugate gradient algorithm for unconstrained optimization
• Testing Unconstrained Optimization Software
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• The conjugate gradient method in extremal problems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• A spectral conjugate gradient method for unconstrained optimization