✦ LIBER ✦

A generalized conjugate gradient algorithm for minimization

✍ Scribed by Fridrich Sloboda

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 289 KB
Volume: 35
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01396318

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combined conjugate-gradient quasi-Newt

A combined conjugate-gradient quasi-Newton minimization algorithm

✍ A. G. Buckley 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 552 KB

Conjugate gradient methods for the Rayle

Conjugate gradient methods for the Rayleigh quotient minimization of generalized eigenvalue problems

✍ H. Yang 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 699 KB

In Favor of Conjugate Directions: a Gene

In Favor of Conjugate Directions: a Generalized Acceptable-point Algorithm for Function Minimization

✍ M.A. Townsend; G.E. Johnson 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 915 KB

## A generalization of the conjugate directions minimization technique enables utilization of a coarse univariate subsearch to identify acceptable points (as opposed to a minimizing line search) and performs better than commonly-used conjugate directions algorithms. It performs comparably to and has

Generalized conjugate directions for unc

Generalized conjugate directions for unconstrained function minimization

✍ D. G. McDowell 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 408 KB

A stable, rapidly converging conjugate g

A stable, rapidly converging conjugate gradient method for energy minimization

✍ Stanley J. Watowich; Eric S. Meyer; Ray Hagstrom; Robert Josephs 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 908 KB

We apply Shanno's conjugate gradient algorithm to the problem of minimizing the potential energy function associated with molecular mechanical calculations. Shanno's algorithm is stable with respect to roundoff errors and inexact line searches and converges rapidly to a minimum. Equally important, t

Improvements on a robust conjugate-gradi

Improvements on a robust conjugate-gradient algorithm which minimizes L-functions

✍ W.S. Gesing; E.J. Davison 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 123 KB

This note outlines some modifications in implementing the Davison Wang algorithm[l] for minimizing functions with a finite number of variables; the modifications result in fewer function evaluations required for calculating the gradients of the objective function.