This is the first book–length treatment of risk–sensitive control, with many new results. The quadratic cost function of the standard LQG (linear/quadratic/Gaussian) treatment is replaced by the exponential of a quadratic, giving the so–called LEQG formulation allowing for a degree of optimism or pessimism on the part of the optimiser. The author is the first to achieve formulation and proof of risk–sensitive versions of the certainty–equivalence and separation principles. Further analysis allows one to formulate the optimization as the extremization of a path integral and to characterize the solution in terms of canonical factorization. It is thus possible to achieve the long–sought goal of an operational stochastic maximum principle, valid for a higher–order model, and in fact only evident when the models are extended to the risk–sensitive class. Additional results include deduction of compact relations between value functions and canonical factors, the exploitation of the equivalence between policy improvement and Newton?Raphson methods and the direct relation of LEQG methods to the H??? and minimum–entropy methods. This book will prove essential reading for all graduate students, researchers and practitioners who have an interest in control theory including mathematicians, engineers, economists, physicists and psychologists. 1990 Stochastic Programming Peter Kall, University of Zürich, Switzerland and Stein W. Wallace, University of Trondheim, Norway Stochastic Programming is the first textbook to provide a thorough and self–contained introduction to the subject. Carefully written to cover all necessary background material from both linear and non–linear programming, as well as probability theory, the book draws together the methods and techniques previously described in disparate sources. After introducing the terms and modelling issues when randomness is introduced in a deterministic mathematical programming model, the authors cover decision trees and dynamic programming, recourse problems, probabilistic constraints, preprocessing and network problems. Exercises are provided at the end of each chapter. Throughout, the emphasis is on the appropriate use of the techniques, rather than on the underlying mathematical proofs and theories, making the book ideal for researchers and students in mathematical programming and operations research who wish to develop their skills in stochastic programming. 1994
Risk–Sensitive and H infinity Criteria.
Time–Integral Methods and Optimal Stationary Policies.
Near–Determinism and Large Deviation Theory.