Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
From MaRDI portal
Publication:2941432
DOI10.1287/OPRE.2014.1322zbMATH Open1327.90149OpenAlexW2154463167MaRDI QIDQ2941432FDOQ2941432
Authors: David B. Brown, James E. Smith 
Publication date: 28 August 2015
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2014.1322
Recommendations
- Information relaxations and duality in stochastic dynamic programs
- Approximations to stochastic dynamic programs via information relaxation duality
- Weakly Coupled Dynamic Program: Information and Lagrangian Relaxations
- Information Relaxation Bounds for Partially Observed Markov Decision Processes
- Information Relaxation and Dual Formulation of Controlled Markov Diffusions
- On the information-based complexity of stochastic programming
- Information-Based Complexity, Feedback and Dynamics in Convex Programming
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Information relaxation bounds for infinite horizon Markov decision processes
- An information-based approximation scheme for stochastic optimization problems in continuous time
Cited In (17)
- Dynamic portfolio execution and information relaxations
- Tax-aware dynamic asset allocation
- Dynamic programs with shared resources and signals: dynamic fluid policies and asymptotic optimality
- Technical note -- Product-based approximate linear programs for network revenue management
- Approximations to stochastic dynamic programs via information relaxation duality
- Dynamic learning and decision making via basis weight vectors
- Merchant commodity storage practice revisited
- Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Numerical solutions to dynamic portfolio problems with upper bounds
- Information Relaxation and Dual Formulation of Controlled Markov Diffusions
- Information relaxation bounds for infinite horizon Markov decision processes
- Simple explicit formula for near-optimal stochastic lifestyling
- Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
- An approximation algorithm for network revenue management under nonstationary arrivals
- A subgradient method based on gradient sampling for solving convex optimization problems
- Information relaxations and duality in stochastic dynamic programs
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
This page was built for publication: Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941432)
