Non-asymptotic confidence bounds for the optimal value of a stochastic program
Guigues, Vincent Gérard Yannick; Juditsky, Anatoli; Nemirovski, Arkadi Semenovich
O documento é disponibilizado pela fonte de origem, que mantém a versão integral e as condições de uso.
Resumo
We discuss a general approach to building non-asymptotic confidence bounds for stochastic optimization problems. Our principal contribution is the observation that a Sample Average Approximation of a problem supplies upper and lower bounds for the optimal value of the problem which are essentially better than the quality of the corresponding optimal solutions. At the same time, such bounds are more reliable than 'standard' confidence bounds obtained through the asymptotic approach. We also discuss bounding the optimal value of MinMax Stochastic Optimization and stochastically constrained problems. We conclude with a small simulation study illustrating the numerical behavior of the proposed bounds.
Ficha do documento
- Tipo
- Artigo científico
- Ano
- 2016
- Instituição
- EMAp - Escola de Matemática Aplicada
- Fonte
- Repositório da FGV
- Idioma
- Inglês
- Acesso
- Não informado
- Identificador
- oai:repositorio.fgv.br:10438/16242
- Temas
- Economia
Conteúdos relacionados
- Artigo científicoJoint dynamic probabilistic constraints with projected linear decision rulesEMAp - Escola de Matemática Aplicada · 2016
- Artigo científicoConvergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programsEMAp - Escola de Matemática Aplicada · 2016
- Artigo científicoMultistep stochastic mirror descent for risk-averse convex stochastic programs based on extended polyhedral risk measuresEMAp - Escola de Matemática Aplicada · 2016
- DissertaçãoOpções de longo prazoFundação Getulio Vargas · 2024
