Stochastic Recursive Algorithms for Optimization: Simultaneous Perturbation Methods
โ Scribed by S. Bhatnagar, H.L. Prasad, L.A. Prashanth (auth.)
- Publisher
- Springer-Verlag London
- Year
- 2013
- Tongue
- English
- Leaves
- 309
- Series
- Lecture Notes in Control and Information Sciences 434
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms:
โข are easily implemented;
โข do not require an explicit system model; and
โข work with real or simulated data.
Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix.
The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from similarly diverse backgrounds: workers in relevant areas of computer science, control engineering, management science, applied mathematics, industrial engineering and operations research will find the content of value.
โฆ Table of Contents
Front Matter....Pages 1-15
Front Matter....Pages 1-2
Introduction....Pages 3-12
Deterministic Algorithms for Local Search....Pages 13-15
Stochastic Approximation Algorithms....Pages 17-28
Front Matter....Pages 29-30
Kiefer-Wolfowitz Algorithm....Pages 31-39
Gradient Schemes with Simultaneous Perturbation Stochastic Approximation....Pages 41-76
Smoothed Functional Gradient Schemes....Pages 77-102
Front Matter....Pages 103-104
Newton-Based Simultaneous Perturbation Stochastic Approximation....Pages 105-131
Newton-Based Smoothed Functional Algorithms....Pages 133-148
Front Matter....Pages 149-150
Discrete Parameter Optimization....Pages 151-166
Algorithms for Constrained Optimization....Pages 167-186
Reinforcement Learning....Pages 187-220
Front Matter....Pages 221-223
Service Systems....Pages 225-241
Road Traffic Control....Pages 243-255
Communication Networks....Pages 257-280
Back Matter....Pages 0--1
โฆ Subjects
Control; Calculus of Variations and Optimal Control; Optimization; Systems Theory, Control
๐ SIMILAR VOLUMES
Probabilistic analysis is increasing in popularity and importance within engineering and the applied sciences. However, the stochastic perturbation technique is a fairly recent development and therefore remains as yet unknown to many students, researchers and engineers. Fields in which the methodolo
Probabilistic analysis is increasing in popularity and importance within engineering and the applied sciences. However, the stochastic perturbation technique is a fairly recent development and therefore remains as yet unknown to many students, researchers and engineers. Fields in which the methodolo
Discrete event systems (DES) have become pervasive in our daily lives. Examples include (but are not restricted to) manufacturing and supply chains, transportation, healthcare, call centers, and financial engineering. However, due to their complexities that often involve millions or even billions of
This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of vi
<P>Optimization problems arising in practice involve random parameters. For the computation of robust optimal solutions, i.e., optimal solutions being insensitive with respect to random parameter variations, deterministic substitute problems are needed. Based on the distribution of the random data,