The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
From MaRDI portal
Publication:5495597
DOI10.1080/02331934.2012.717622zbMATH Open1305.90386OpenAlexW2092640864MaRDI QIDQ5495597FDOQ5495597
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
Recommendations
- A note on the convergence properties of the original three-term Hestenes-Stiefel method
- A modified Hestenes-Stiefel conjugate gradient method with an optimal property
- Global convergence of two kinds of three-term conjugate gradient methods without line search
- scientific article; zbMATH DE number 1371602
- An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Benchmarking optimization software with performance profiles.
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Restart procedures for the conjugate gradient method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Some descent three-term conjugate gradient methods and their global convergence
- Methods of conjugate gradients for solving linear systems
- On restart procedures for the 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
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
- Some convergence properties of the conjugate gradient method
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Linear Convergence of the Conjugate Gradient Method
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
This page was built for publication: The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495597)