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

DOI10.1007/S40314-013-0006-XzbMATH Open1275.90094OpenAlexW2007987674MaRDI QIDQ2392968FDOQ2392968

Authors 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)

Recommendations

• A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
• Convergence of Liu-Storey conjugate method with nonmonotone Armijo line search
• Rate of convergence of a restarted CG-DESCENT method
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy
• Convergence of Liu-Storey conjugate gradient method

Cites work

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

Describes a project that uses

Uses Software

• CUTEr
• CUTE

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

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