Convergence properties of the Beale-Powell restart algorithm
From MaRDI portal
Publication:1286637
DOI10.1007/BF02871976zbMath0919.65042OpenAlexW2028736557MaRDI QIDQ1286637
Publication date: 23 August 1999
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02871976
unconstrained optimizationglobal convergenceconjugate gradientlinear searchlarge-scale unconstrained optimizationBeale-Powell restart algorithm
Related Items
On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Adaptive trust-region method on Riemannian manifold ⋮ A scaled nonlinear conjugate gradient algorithm for unconstrained optimization ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction ⋮ Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization ⋮ 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 ⋮ Convergence of descent method without line search ⋮ A new super-memory gradient method with curve search rule ⋮ An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Alternative proofs of the convergence properties of the conjugate- gradient method
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- Line search algorithms with guaranteed sufficient decrease
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Convergence properties of the Fletcher-Reeves method
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Linear Convergence of the Conjugate Gradient Method