The Conjugate Residual Method for Constrained Minimization Problems
Open Access
- 1 September 1970
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 7 (3), 390-398
- https://doi.org/10.1137/0707032
Abstract
International audienceThe method of conjugate gradients, a particular version of the general class of conjugate direction methods, was originally developed for solving a linear system of equations$$ Ax = b,$$where $A$ is an $n \times n$ symmetric, positive definite matrix, $x$ is an unknown $n$-vector and $b$ is a fixed $n$-vector. The conjugate gradient method can be viewed as a descent procedure for the problem : Minimize$$(x , Ax) - 2(x, b);$$and through this viewpoint the method can be generalized so as to apply to the solution of general unconstrained minimization problems. For these general problems conjugate gradient methods are among the most effective first order descent procedures
Keywords
This publication has 6 references indexed in Scilit:
- Hyperbolic Pairs in the Method of Conjugate GradientsSIAM Journal on Applied Mathematics, 1969
- Convergence of the conjugate gradient method with computationally convenient modificationsNumerische Mathematik, 1967
- The Conjugate Gradient Method for Linear and Nonlinear Operator EquationsSIAM Journal on Numerical Analysis, 1967
- Some Algorithms for Minimizing a Function of Several VariablesJournal of the Society for Industrial and Applied Mathematics, 1964
- Function minimization by conjugate gradientsThe Computer Journal, 1964
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952