EUVIMEDEUVIMED entdecken
Crossref

Numerical Methods for Convex Multistage Stochastic Optimization

Guanghui Lan, Alexander Shapiro

Foundations and Trends in Optimization · 2024

DOI: 10.1561/2400000044 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Foundations and Trends in Optimization, 2024. Verfasst von Guanghui Lan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 77 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Optimization problems involving sequential decisions in a stochastic environment were studied in Stochastic Programming (SP), Stochastic Optimal Control (SOC) and Markov Decision Processes (MDP). In this monograph, we mainly concentrate on SP and SOC modeling approaches. In these frameworks, there are natural situations when the considered problems are convex. The classical approach to sequential optimization is based on dynamic programming. It has the problem of the so-called “curse of dimensionality”, in that its computational complexity increases exponentially with respect to the dimension of state variables. Recent progress in solving convex multistage stochastic problems is based on cutting plane approximations of the cost-to-go (value) functions of dynamic programming equations. Cutting plane type algorithms in dynamical settings is one of the main topics of this monograph. We also discuss stochastic approximation type methods applied to multistage stochastic optimization problems. From the computational complexity point of view, these two types of methods seem to be complementary to each other. Cutting plane type methods can handle multistage problems with a large number of stages but a relatively smaller number of state (decision) variables. On the other hand, stochastic approximation type methods can only deal with a small number of stages but a large number of decision variables.

Zitieren

APA

Lan, G., & Shapiro, A. (2024). Numerical Methods for Convex Multistage Stochastic Optimization. Foundations and Trends in Optimization. https://doi.org/10.1561/2400000044

Vancouver

Lan G, Shapiro A. Numerical Methods for Convex Multistage Stochastic Optimization. Foundations and Trends in Optimization. 2024. doi:10.1561/2400000044

BibTeX
@article{Lan2024,
  author = {Lan, Guanghui and Shapiro, Alexander},
  title = {Numerical Methods for Convex Multistage Stochastic Optimization},
  journal = {Foundations and Trends in Optimization},
  year = {2024},
  doi = {10.1561/2400000044}
}
Kostenlos starten →