Approximate Dynamic Programming. Solving the Curses of Dimensionality. 2nd Edition. Wiley Series in Probability and Statistics
- Language: English
- 656 Pages
- Published: November 2011
This product is currently not available for purchase.
Stochastic programs form a class of optimization problems that have seen much attention in the last decade. As has the class of equilibrium problems which have resulted largely from the analytic treatment of Nash games. This thesis delves into some challenging areas of stochastic optimization and stochastic equilibrium programming. Our interest is in understanding properties of these problems and in developing algorithms for solving such problems. We first consider a two-period stochastic nonlinear program. In this context, we obtain new insights into the notions of feasibility and recourse for such programs and develop an algorithm based on sequential quadratic programming. The algorithm uses two quadratic programming solvers based on Benders decomposition: an inexact cut version of the L-shaped method and a trust-region method. We next consider stochastic equilibrium problems arising from Nash-Cournot competition, inspired by a Cournot bidding model for electricity markets. We first show existence and uniqueness of Nash equilibria to a wide class of stochastic quadratic games and then develop a splitting method that can be decomposed scenario-wise to compute such equilibria.
Ankur, A. Kulkarni.
Ankur was born in Mumbai, India in 1983. He received his B.Tech. in Aerospace Engineering from the Indian Institute of Technology, Bombay in 2006 and is pursuing a Ph.D. in Industrial Engineering at the University of Illinois, Urbana-Champaign. His research interests are in game theory, mathematical programming, economics and applied probability.