\(n\)-step quadratic convergence of a restart Liu-Storey type method

DOI10.1007/s40314-013-0006-xzbMath1275.90094OpenAlexW2007987674MaRDI QIDQ2392968

Aiping Qu

Publication date: 5 August 2013

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-013-0006-x

zbMATH Keywords

unconstrained optimization\(n\)-step quadratic convergencerestart conjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Uses Software

• CUTEr
• CUTE

Cites Work

• \(n\)-step quadratic convergence of the MPRP method with a restart strategy
• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• Some convergence properties of the conjugate gradient method
• CUTE
• Rate of Convergence of Several Conjugate Gradient Algorithms
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Linear Convergence of the Conjugate Gradient Method
• Benchmarking optimization software with performance profiles.

This page was built for publication: \(n\)-step quadratic convergence of a restart Liu-Storey type method