### Abstract

Conjugate gradient algorithms for large optimization problems are studied. These methods accelerate (or precondition) the conjugate gradient method by means of quasi-Newton matrices, and are designed to utilize a variable amount of storage, depending on how much information is retained in the quasi-Newton matrices. The behavior of such methods on the underlying quadratic model, and in particular, the finite termination properties are considered.

Original language | English (US) |
---|---|

Title of host publication | Mathematical Programming |

Pages | 326-340 |

Number of pages | 15 |

Edition | 3 |

State | Published - Aug 1 1982 |

### Publication series

Name | Mathematical Programming |
---|---|

Number | 3 |

Volume | 23 |

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'CONJUGATE DIRECTION METHODS WITH VARIABLE STORAGE.'. Together they form a unique fingerprint.

## Cite this

Nazareth, L., & Nocedal, J. (1982). CONJUGATE DIRECTION METHODS WITH VARIABLE STORAGE. In

*Mathematical Programming*(3 ed., pp. 326-340). (Mathematical Programming; Vol. 23, No. 3).