On restart procedures for the conjugate gradient method
From MaRDI portal
Publication:596670
DOI10.1023/B:NUMA.0000021761.10993.6ezbMath1137.90669OpenAlexW2072258407WikidataQ57445514 ScholiaQ57445514MaRDI QIDQ596670
Yu-Hong Dai, Li-Zhi Liao, Li, Duan
Publication date: 10 August 2004
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:numa.0000021761.10993.6e
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)
Related Items (22)
Free terminal time optimal control problem of an HIV model based on a conjugate gradient method ⋮ Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update ⋮ On the finite load capacity in misaligned journal bearings ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Practical perspectives on symplectic accelerated optimization ⋮ A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization ⋮ A restart scheme for the memoryless BFGS method ⋮ \(n\)-step quadratic convergence of the MPRP method with a restart strategy ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization ⋮ Scaling to the stars -- a linearly scaling elliptic solver for \(p\)-multigrid ⋮ Modelling and optimal control of immune response of renal transplant recipients ⋮ Series solution of the multispecies Lotka-Volterra equations by means of the homotopy analysis method ⋮ Hybrid conjugate gradient algorithm for unconstrained optimization ⋮ Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems ⋮ A modified Polak–Ribière–Polyak 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 ⋮ A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter ⋮ Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
Uses Software
This page was built for publication: On restart procedures for the conjugate gradient method
