[Lecture Notes in Control and Information Sciences] Stochastic Recursive Algorithms for Optimization Volume 434 || Deterministic Algorithms for Local Search

✍ Scribed by Bhatnagar, S.; Prasad, H.L.; Prashanth, L.A.

• Book ID: 120233042
• Publisher: Springer London
• Year: 2013
• Tongue: English
• Weight: 236 KB
• Edition: 7
• Category: Article
• ISBN: 1447142853
• DOI: 10.1007/978-1-4471-4285-0_2

✦ 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.