✦ LIBER ✦

Optimal search paths for random variables

✍ Scribed by Peter J. Rousseeuw

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 642 KB
Volume: 9
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(83)90020-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On c-optimal random variables

✍ Ludger Rüschendorf 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Random search techniques for optimizatio

Random search techniques for optimization problems

✍ Dean C. Karnopp 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 663 KB

The attributes of flexibility and efficiency attainable with random search techniques are discussed as well as a scope of application ranging from uses involving high speed general purpose computers to extremely simple adaptive devices. ## 1. Introduction ONLY IN recent years has serious study bee

Robustness of optimal designs for correl

Robustness of optimal designs for correlated random variables

✍ Joe Masaro; Chi Song Wong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Adaptive random search for continuous si

Adaptive random search for continuous simulation optimization

✍ Sigrún Andradóttir; Andrei A. Prudius 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 941 KB

Tabu search method with random moves for

Tabu search method with random moves for globally optimal design

✍ Nanfang Hu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty method

Optimization by random search with jumps

✍ Chunshien Li; Roland Priemer; Kuo-Hsiang Cheng 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB