\(n\)-step quadratic convergence of the MPRP method with a restart strategy

DOI10.1016/j.cam.2011.04.026zbMath1221.65144OpenAlexW1976471540MaRDI QIDQ633952

Bo-Shi Tian, Dong-hui Li

Publication date: 2 August 2011

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

Full work available at URL: https://doi.org/10.1016/j.cam.2011.04.026

zbMATH Keywords

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (9)

The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations ⋮ \(n\)-step quadratic convergence of a restart Liu-Storey type method ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions ⋮ A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems ⋮ A new method with sufficient descent property for unconstrained optimization ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems ⋮ Rate of Convergence of a Restarted CG-DESCENT Method

Uses Software

• L-BFGS

Cites Work

• On restart procedures for the conjugate gradient method
• On the limited memory BFGS method for large scale optimization
• On the rate of superlinear convergence of a class of variable metric methods
• Convergence properties of the Beale-Powell restart algorithm
• Optimization. Algorithms and consistent approximations
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A three-parameter family of nonlinear conjugate gradient methods
• Die Konvergenzordnung des Fletcher-Powell-Algorithmus
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Some convergence properties of the conjugate gradient method
• Restart procedures for the conjugate gradient method
• Rate of Convergence of Several Conjugate Gradient Algorithms
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Linear Convergence of the Conjugate Gradient Method
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(n\)-step quadratic convergence of the MPRP method with a restart strategy