Convex Stochastic Optimization: Dynamic Programming and Duality in Discrete Time: 107 2024th Edition

Convex Stochastic Optimization: Dynamic Programming and Duality in Discrete Time: 107 2024th Edition book cover

Convex Stochastic Optimization: Dynamic Programming and Duality in Discrete Time: 107 2024th Edition

Author(s): Teemu Pennanen (Author), Ari-Pekka Perkkiö (Author)

  • Publisher: Springer
  • Publication Date: 19 Dec. 2024
  • Edition: 2024th
  • Language: English
  • Print length: 423 pages
  • ISBN-10: 3031764315
  • ISBN-13: 9783031764318

Book Description

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.

Editorial Reviews

Review

“The book integrates classical models with significant new generalizations, covering discrete-time stochastic control, financial mathematics, and inequality-constrained stochastic programs. Each chapter includes both theoretical foundations and applied results. Appendices review key tools from convex analysis and probability. The book provides a modern approach to convex stochastic optimization that unifies and extends existing theory. For that reason this book will be a valuable reading for researchers and advanced students in stochastic optimization, mathematical finance, operations research, and stochastic optimal control.” (Marcin Anholcer, Mathematical Reviews, February, 2026)

From the Back Cover

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.

View on Amazon

电子书代发PDF格式价格30我要求助
未经允许不得转载:Wow! eBook » Convex Stochastic Optimization: Dynamic Programming and Duality in Discrete Time: 107 2024th Edition