Rate of Convergence of Several Conjugate Gradient Algorithms
From MaRDI portal
Cited in
(38)- Conjugate gradient method for systems of nonlinear equations
- Accelerating procedures for methods of conjugate directions
- Approximation methods for the unconstrained optimization
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
- Large sparse continuation problems
- Convergence properties of the Beale-Powell restart algorithm
- Generalized Polak-Ribière algorithm
- A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- Analysis of optimization algorithms via sum-of-squares
- The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- Efficient generalized conjugate gradient algorithms. II: Implementation
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- \(n\)-step quadratic convergence of a restart Liu-Storey type method
- Alternative proofs of the convergence properties of the conjugate- gradient method
- Linear convergence of descent methods for the unconstrained minimization of restricted strongly convex functions
- Rate of convergence of a restarted CG-DESCENT method
- A hybrid algorithm for finding a global minimum
- Readily implementable conjugate gradient methods
- The convergence rate of a restart MFR conjugate gradient method with inexact line search
- Une methode de gradient conjugue sur des varietes application a certains problemes de valeurs propres non lineaires
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
- On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class
- Conjugate gradient predictor corrector method for solving large scale problems
- The Hager-Zhang conjugate gradient algorithm for large-scale nonlinear equations
- The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems
- Integrating Multisource Block-Wise Missing Data in Model Selection
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
- On the convergence rate of Fletcher‐Reeves nonlinear conjugate gradient methods satisfying strong Wolfe conditions: Application to parameter identification in problems governed by general dynamics
- \(n\)-step quadratic convergence of the MPRP method with a restart strategy
- Nonlinear conjugate gradient for smooth convex functions
- A new three-term conjugate gradient method
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
This page was built for publication: Rate of Convergence of Several Conjugate Gradient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4765945)