✦ LIBER ✦

A rank-one algorithm for unconstrained function minimization

✍ Scribed by D. O. Norris; J. D. Gerken

Publisher: Springer
Year: 1977
Tongue: English
Weight: 643 KB
Volume: 21
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00933530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

CGS algorithms for unconstrained minimiz

CGS algorithms for unconstrained minimization of functions

✍ R. F. Dennemeyer; E. H. Mookini 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 806 KB

Generalized conjugate directions for unc

Generalized conjugate directions for unconstrained function minimization

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

A variable metric algorithm for unconstr

A variable metric algorithm for unconstrained minimization without evaluation of derivatives

✍ J. Bräuninger 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 573 KB

A modified homogeneous algorithm for fun

A modified homogeneous algorithm for function minimization

✍ D.H Jacobson; L.M Pels 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A Fully Combinatorial Algorithm for Subm

A Fully Combinatorial Algorithm for Submodular Function Minimization

✍ Satoru Iwata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.

A new conic method for unconstrained min

A new conic method for unconstrained minimization

✍ A Bacopoulos; C.A Botsaris 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 768 KB