The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems

DOI10.1080/02331934.2012.717622zbMath1305.90386OpenAlexW2092640864MaRDI QIDQ5495597

Juan Liu, Aiping Qu

Publication date: 5 August 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.717622

zbMATH Keywords

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• The convergence rate of a restart MFR conjugate gradient method with inexact line search
• On restart procedures for the conjugate gradient method
• \(n\)-step quadratic convergence of the MPRP method with a restart strategy
• On the rate of superlinear convergence of a class of variable metric methods
• Convergence properties of the Beale-Powell restart algorithm
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Some convergence properties of the conjugate gradient method
• Restart procedures for the conjugate gradient method
• Rate of Convergence of Several Conjugate Gradient Algorithms
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Some descent three-term conjugate gradient methods and their global convergence
• Linear Convergence of the Conjugate Gradient Method
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.

This page was built for publication: The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems