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

DOI10.1016/J.CAM.2011.04.026zbMATH Open1221.65144OpenAlexW1976471540MaRDI QIDQ633952FDOQ633952

Authors: Boshi 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

Recommendations

• Global convergence of a modified PRP conjugate gradient method and its numerical results
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• A modified PRP conjugate gradient method
• A modified Polak-Ribière-Polyak descent method for unconstrained optimization
• Global convergence of a modified PRP conjugate gradient method

zbMATH Keywords

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

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

Cited In (10)

• A new method with sufficient descent property for unconstrained optimization
• A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations
• Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints
• Rate of convergence of a restarted CG-DESCENT method
• 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
• \(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

Uses Software

• L-BFGS

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

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