The convergence rate of a restart MFR conjugate gradient method with inexact line search
From MaRDI portal
Publication:387662
DOI10.1016/j.amc.2012.05.023zbMath1280.65055OpenAlexW1965353407MaRDI QIDQ387662
Aiping Qu, Dong-hui Li, Min Li
Publication date: 23 December 2013
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2012.05.023
unconstrained optimizationnumerical resultsinexact line search\(n\)-step quadratic convergencerestart Fletcher-Reeves conjugate gradient method
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- 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
- Function minimization by conjugate gradients
- Linear Convergence of the Conjugate Gradient Method
- Benchmarking optimization software with performance profiles.
