Skip to main content
Book cover

Convex and Stochastic Optimization

  • Textbook
  • © 2019

Overview

  • Provides a pedagogical, self-contained analysis of the theory of convex optimization and stochastic programming
  • Offers a synthetical view of many applications such as semidefinite programming, Markov processes, generalized convexity and optimal transport
  • Includes a study of algorithmic aspects: dynamic programming, stochastic dual dynamic programming (in the case of convex Bellman value functions) and linear decision rules

Part of the book series: Universitext (UTX)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 29.99 USD 49.99
40% discount Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 39.99 USD 64.99
38% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

Keywords

About this book

This textbook provides an introduction to convex duality for optimization problems in Banach spaces, integration theory, and their application to stochastic programming problems in a static or dynamic setting. It introduces and analyses the main algorithms for stochastic programs, while the theoretical aspects are carefully dealt with.

The reader is shown how these tools can be applied to various fields, including approximation theory, semidefinite and second-order cone programming and linear decision rules.

This textbook is recommended for students, engineers and researchers who are willing to take a rigorous approach to the mathematics involved in the application of duality theory to optimization with uncertainty.

Reviews

“The book is mainly devoted to the theoretical study of concepts of stochastic programming. … The book offers a solid theoretical background for researchers/students/practitioners keen on disposing of a rigorous foundation of stochastic programming.” (Wim van Ackooij, Mathematical Reviews, November, 2019)

Authors and Affiliations

  • Inria and CMAP, Ecole Polytechnique, Palaiseau, France

    J. Frédéric Bonnans

About the author

J.F. Bonnans is an expert in convex analysis and dynamic optimization, both in the deterministic and stochastic setting. His main contributions deal with the sensitivity analysis of optimization problems, high order optimality conditions, optimal control and stochastic control. He worked on quantization methods for stochastic programming problems, on the approximate dynamic programming for problems with monotone value function, and on sparse linear regression.

Bibliographic Information

Publish with us