Optimization Under Stochastic Uncertainty: Methods, Control and Random Search Methods

Marti, Kurt

ISBN 10: 3030556611 / ISBN 13: 9783030556617

Editore: Springer Nature, 2020

Riguardo questo articolo

407 pages. 9.25x6.10x9.21 inches. In Stock.

Codice articolo x-3030556611

Dati bibliografici

• Titolo: Optimization Under Stochastic Uncertainty: Methods, Control and Random Search Methods
• Editore: Springer Nature
• Data di pubblicazione: 2020
• Lingua: Inglese
• ISBN 10: 3030556611
• ISBN 13: 9783030556617
• Rilegatura: Hardcover
• Condizione: Brand New
• Peso: 0,75 chilogrammi

Descrizione articolo

Riassunto

This book examines application and methods to incorporating stochastic parameter variations into the optimization process to decrease expense in corrective measures. Basic types of deterministic substitute problems occurring mostly in practice involve i) minimization of the expected primary costs subject to expected recourse cost constraints (reliability constraints) and remaining deterministic constraints, e.g. box constraints, as well as ii) minimization of the expected total costs (costs of construction, design, recourse costs, etc.) subject to the remaining deterministic constraints.

After an introduction into the theory of dynamic control systems with random parameters, the major control laws are described, as open-loop control, closed-loop, feedback control and open-loop feedback control, used for iterative construction of feedback controls. For approximate solution of optimization and control problems with random parameters and involving expected cost/loss-type objective, constraint functions, Taylor expansion procedures, and Homotopy methods are considered, Examples and applications to stochastic optimization of regulators are given. Moreover, for reliability-based analysis and optimal design problems, corresponding optimization-based limit state functions are constructed. Because of the complexity of concrete optimization/control problems and their lack of the mathematical regularity as required of Mathematical Programming (MP) techniques, other optimization techniques, like random search methods (RSM) became increasingly important.

Basic results on the convergence and convergence rates of random search methods are presented. Moreover, for the improvement of the – sometimes very low – convergence rate of RSM, search methods based on optimal stochastic decision processes are presented. In order to improve the convergence behavior of RSM, the random search procedure is embedded into a stochastic decision process for an optimal control of the probability distributions of the search variates (mutation random variables).

Informazioni sull?autore

Kurt Marti is a Professor of Engineering Mathematics at the University of Bundeswehr Munich. He has been Chairman of the IFIP-Working Group 7.7 on “Stochastic Optimization” and  Chairman of the GAMM-Special Interest Group “Applied Stochastics and Optimization”. Professor Marti has published several books, both in German and in English and he is author of more than 160 papers in refereed journals and book chapters.