𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimization by random search with jumps

✍ Scribed by Chunshien Li; Roland Priemer; Kuo-Hsiang Cheng


Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
104 KB
Volume
60
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Random search techniques for optimizatio
✍ 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

Tabu search method with random moves for
✍ 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

Jump Linear Quadratic control with Rando
✍ M. Mariton πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 372 KB

In a random environment, Jump Linear Quadratic control problems are studied. Random state discontinuities are included in the analysis and the corresponding optimal regulator is obtained. The introduction of stochastic notions of stabilizability and detectability gives a direct characterization of t