Convex Stochastic Optimization Dynamic Programming and Duality in Discrete Time

This book studies a general class of convex stochastic optimization (CSO) problems that unifies many common problem formulations from operations research, financial mathematics and stochastic optimal control. We extend the theory of dynamic programming and convex duality to allow for a unified and s...

Full description

Bibliographic Details
Main Authors: Pennanen, Teemu, Perkkiö, Ari-Pekka (Author)
Format: eBook
Language:English
Published: Cham Springer Nature Switzerland 2024, 2024
Edition:1st ed. 2024
Series:Probability Theory and Stochastic Modelling
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Description
Summary:This book studies a general class of convex stochastic optimization (CSO) problems that unifies many common problem formulations from operations research, financial mathematics and stochastic optimal control. We extend the theory of dynamic programming and convex duality to allow for a unified and simplified treatment of various special problem classes found in the literature. The extensions allow also for significant generalizations to existing problem formulations. Both dynamic programming and duality have played crucial roles in the development of various optimality conditions and numerical techniques for the solution of convex stochastic optimization problems
Physical Description:XI, 412 p online resource
ISBN:9783031764325