✦ LIBER ✦

Supermemory descent methods for unconstrained minimization

✍ Scribed by M. A. Wolfe; C. Viazminsky

Publisher: Springer
Year: 1976
Tongue: English
Weight: 644 KB
Volume: 18
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00932655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Descent methods for quasidifferentiable

Descent methods for quasidifferentiable minimization

✍ Krzysztof C. Kiwiel 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 930 KB

Choosing descent directions in unconstra

Choosing descent directions in unconstrained minimization problems

✍ I. Ya. Zabotin 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 316 KB

Some methods of unconstrained minimizati

Some methods of unconstrained minimization

✍ Han Chan 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 851 KB

Some methods of unconstrained minimizati

Some methods of unconstrained minimization

✍ B.N. Pshenichnyi; N.N. Redkovskii 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 432 KB

New combined method for unconstrained mi

New combined method for unconstrained minimization

✍ L. Lukšan 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 713 KB

The spherical quadratic steepest descent

The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches

✍ J.A. Snyman; A.M. Hay 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A very simple gradient only algorithm for unconstrained minimization is proposed that, in terms of storage requirement and computational efficiency, may be considered as an alternative to the conjugate gradient line search methods for large problems. The method effectively applies the steepest desce