TY  - JOUR
ID  - iiasa13649
UR  - https://pure.iiasa.ac.at/id/eprint/13649/
IS  - 1
A1  - Nazareth, J.L.
Y1  - 1986/07/19/
N2  - The traditional development of conjugate gradient (CG) methods emphasizes notions of conjugacy and the minimization of quadratic functions. The associated theory of conjugate direction methods, strictly a branch of numerical linear algebra, is both elegant and useful for obtaining insight into algorithms for nonlinear minimization. Nevertheless, it is preferable that favorable behavior on a quadratic be a consquence of a more general approach, one which fits in more naturally with Newton and variable metric methods. We give new CG algorithms along these lines and discuss some of their properties, along with some numerical supporting evidence.
JF  - Mathematical Programming
VL  - 35
KW  - conjugate gradients; high-dimensional optimization; Nonlinear minimization; successive affine reduction; variable storage algorithms
SN  - 0025-5610
TI  - The method of successive affine reduction for nonlinear minimization
SP  - 97
AV  - none
EP  - 109
ER  -