✦ LIBER ✦

An Adaptive Random Search Algorithm for Constrained Minimization

✍ Scribed by Beltrami, E. J.; Indusi, J. P.

Book ID: 114605783
Publisher: IEEE
Year: 1972
Tongue: English
Weight: 896 KB
Volume: C-21
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1972.5009077

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

IEEE trans. on comput.: Beltrami, E. J.

IEEE trans. on comput.: Beltrami, E. J. and Indusi, J. P. ‘An adaptive random search algorithm for constrained minimization’. Vol C-21 (September 1972) No 9, pp.1004–1008

📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Pattern Search Algorithms for Bound Cons

Pattern Search Algorithms for Bound Constrained Minimization

✍ Lewis, Robert Michael; Torczon, Virginia 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 352 KB

Analysis and parameter selection for an

Analysis and parameter selection for an adaptive random search algorithm

✍ Rajeeva Kumar; Pierre T. Kabamba; David C. Hyland 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 160 KB

This paper presents an analysis of an adaptive random search (ARS) algorithm, a global minimization method. A probability model is introduced to characterize the statistical properties of the number of iterations required to find an acceptable solution. Moreover, based on this probability model, a n

A method of random search in constrained

A method of random search in constrained minimization problems

✍ D.V. Denisov 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 529 KB

An algorithm for linearly constrained no

An algorithm for linearly constrained nonsmooth convex multiobjective minimization

✍ Krzysztof C Kiwiel 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 206 KB

An algorithm for linearly constrained co

An algorithm for linearly constrained convex nondifferentiable minimization problems

✍ Krzysztof C Kiwiel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 595 KB