Rate of Convergence of Several Conjugate Gradient Algorithms
From MaRDI portal
Publication:4765945
DOI10.1137/0709024zbMath0279.65051OpenAlexW1981831430MaRDI QIDQ4765945
Publication date: 1972
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0709024
Related Items (37)
The Hager–Zhang conjugate gradient algorithm for large-scale nonlinear equations ⋮ Integrating Multisource Block-Wise Missing Data in Model Selection ⋮ Global convergence of the Fletcher-Reeves algorithm with inexact linesearch ⋮ A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems ⋮ \(n\)-step quadratic convergence of a restart Liu-Storey type method ⋮ Convergence of the Polak-Ribiére-Polyak conjugate gradient method ⋮ The convergence rate of a restart MFR conjugate gradient method with inexact line search ⋮ 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 ⋮ A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems ⋮ Convergence conditions for restarted conjugate gradient methods with inaccurate line searches ⋮ A hybrid algorithm for finding a global minimum ⋮ Conjugate gradient predictor corrector method for solving large scale problems ⋮ On the convergence rate of imperfect minimization algorithms in Broyden'sβ-class ⋮ A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems ⋮ Accelerating procedures for methods of conjugate directions ⋮ Proximal methods for nonlinear programming: Double regularization and inexact subproblems ⋮ Readily implementable conjugate gradient methods ⋮ Approximation methods for the unconstrained optimization ⋮ Efficient generalized conjugate gradient algorithms. II: Implementation ⋮ 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 ⋮ An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula ⋮ Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations ⋮ Analysis of optimization algorithms via sum-of-squares ⋮ The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems ⋮ Large sparse continuation problems ⋮ Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions ⋮ Une methode de gradient conjugue sur des varietes application a certains problemes de valeurs propres non lineaires ⋮ A new three-term conjugate gradient method ⋮ Convergence properties of the Beale-Powell restart algorithm ⋮ Alternative proofs of the convergence properties of the conjugate- gradient method ⋮ 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 ⋮ Conjugate gradient method for systems of nonlinear equations ⋮ The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems ⋮ Generalized Polak-Ribière algorithm
This page was built for publication: Rate of Convergence of Several Conjugate Gradient Algorithms
