✦ LIBER ✦

Convergence of a random optimization method for constrained optimization problems

✍ Scribed by N. Baba

Publisher: Springer
Year: 1981
Tongue: English
Weight: 438 KB
Volume: 33
Category: Article
ISSN: 0022-3239
DOI: 10.1007/bf00935752

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Convergence of ODE Method in Constrain

A Convergence of ODE Method in Constrained Optimization

✍ Zhou Zongfang; Yong Shi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 127 KB

This paper proposes a convergence theory of the ordinary differential equations Ž . ODE method for finding the local optima of general constrained optimization. We prove that solutions starting from the neighbourhood of a critical point of the differential equations in this paper about part variable

Constrained gradient method for nonsmoot

Constrained gradient method for nonsmooth optimization problems

✍ I. V. Konnov 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 333 KB

A modified convergence theorem for a ran

A modified convergence theorem for a random optimization method

✍ Norio Baba; Toshio Shoman; Yoshikazu Sawaragi 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Convergence of relaxation methods for no

Convergence of relaxation methods for nondifferentiable constrained optimization

✍ I. V. Konnov 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 404 KB

Globally convergent algorithm for nonlin

Globally convergent algorithm for nonlinearly constrained optimization problems

✍ M. Sahba 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 877 KB

Teaching–learning-based optimization: A

Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems

✍ R.V. Rao; V.J. Savsani; D.P. Vakharia 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 964 KB