Differentiability and Regularization of Parametric Convex Value Functions in Stochastic Multistage Optimization

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Franc, Adrien Le, Carpentier, Pierre, Chancelier, Jean-Philippe, de Lara, Michel
Natura: Preprint
Pubblicazione: 2022
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917346033008640
author Franc, Adrien Le
Carpentier, Pierre
Chancelier, Jean-Philippe
de Lara, Michel
author_facet Franc, Adrien Le
Carpentier, Pierre
Chancelier, Jean-Philippe
de Lara, Michel
contents In multistage decision problems, it is often the case that an initial strategic decision (such as investment) is followed by many operational ones (operating the investment). Such initial strategic decision can be seen as a parameter affecting a multistage decision problem. More generally, we study in this paper a standard multistage stochastic optimization problem depending on a parameter. When the parameter is fixed, Stochastic Dynamic Programming provides a way to compute the optimal value of the problem. Thus, the value function depends both on the state (as usual) and on the parameter. Our aim is to investigate on the possibility to efficiently compute gradients of the value function with respect to the parameter, when these objects exist. When nondifferentiable, we propose a regularization method based on the Moreau-Yosida envelope. We present a numerical test case from day-ahead power scheduling.
format Preprint
id arxiv_https___arxiv_org_abs_2212_10384
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Differentiability and Regularization of Parametric Convex Value Functions in Stochastic Multistage Optimization
Franc, Adrien Le
Carpentier, Pierre
Chancelier, Jean-Philippe
de Lara, Michel
Optimization and Control
In multistage decision problems, it is often the case that an initial strategic decision (such as investment) is followed by many operational ones (operating the investment). Such initial strategic decision can be seen as a parameter affecting a multistage decision problem. More generally, we study in this paper a standard multistage stochastic optimization problem depending on a parameter. When the parameter is fixed, Stochastic Dynamic Programming provides a way to compute the optimal value of the problem. Thus, the value function depends both on the state (as usual) and on the parameter. Our aim is to investigate on the possibility to efficiently compute gradients of the value function with respect to the parameter, when these objects exist. When nondifferentiable, we propose a regularization method based on the Moreau-Yosida envelope. We present a numerical test case from day-ahead power scheduling.
title Differentiability and Regularization of Parametric Convex Value Functions in Stochastic Multistage Optimization
topic Optimization and Control
url https://arxiv.org/abs/2212.10384