✦ LIBER ✦

On the convergence of global methods in multiextremal optimization

✍ Scribed by R. Horst; H. Tuy

Publisher: Springer
Year: 1987
Tongue: English
Weight: 940 KB
Volume: 54
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00939434

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convergence of one-dimensional one-stage

Convergence of one-dimensional one-stage algorithms for multiextremal optimization in the presence of noise

✍ A. Žilinskas; E. Senkienė 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 283 KB

Methods for optimal engineering design p

Methods for optimal engineering design problems based on globally convergent methods

✍ Layne Watson; W.H. Yang 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 603 KB

On convergence rates of subgradient opti

On convergence rates of subgradient optimization methods

✍ J. L. Goffin 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 801 KB

On the Convergence of a Population-Based

On the Convergence of a Population-Based Global Optimization Algorithm

✍ Ş. İlker Birbil; Shu-Cherng Fang; Ruey-Lin Sheu 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 257 KB

On the global convergence of Chebyshev's

On the global convergence of Chebyshev's iterative method

✍ S. Amat; S. Busquier; J.M. Gutiérrez; M.A. Hernández 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 132 KB

In [A. Melman, Geometry and convergence of Euler's and Halley's methods, SIAM Rev. 39(4) (1997) 728-735] the geometry and global convergence of Euler's and Halley's methods was studied. Now we complete Melman's paper by considering other classical third-order method: Chebyshev's method. By using the

Convergence qualification of adaptive pa

Convergence qualification of adaptive partition algorithms in global optimization

✍ János Pintér 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 1021 KB