✦ LIBER ✦

Minimizing functions without calculating derivatives

✍ Scribed by B. N. Pshenichnyi

Publisher: Springer US
Year: 1975
Tongue: English
Weight: 209 KB
Volume: 9
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068595

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the accelerating property of an algor

On the accelerating property of an algorithm for function minimization without calculating derivatives

✍ P. L. Toint; F. M. Callier 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 751 KB

On the accelerating property of an algor

On the accelerating property of an algorithm for function minimization without calculating derivatives

✍ F. M. Calliee; P. L. Toint 📂 Article 📅 1978 🏛 Springer 🌐 English ⚖ 149 KB

Random minimization without calculation

Random minimization without calculation of derivatives

✍ O. V. Guseva 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 289 KB

A minimization method without the calcul

A minimization method without the calculation of derivatives

✍ Yu.M. Danilin; B.N. Pshenichnyi 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 692 KB

Minimal-time function in problems withou

Minimal-time function in problems without local controllability

✍ F. Mignanego; G. Pieri 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 351 KB

Sequential and parallel algorithms for g

Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives

✍ V.P. Gergel; Ya.D. Sergeyev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 954 KB

In this paper, sequential and parallel algorithms using derivatives for solving unconstrained one-dimensional global optimization problems are described. Sufficient conditions of convergence to all global minimizers are established for both methods. Parallel algorithm conditions, which guarantee sig