Information relaxations and duality in stochastic dynamic programs
From MaRDI portal
Recommendations
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Approximations to stochastic dynamic programs via information relaxation duality
- Information relaxation bounds for infinite horizon Markov decision processes
- Dynamic portfolio execution and information relaxations
- On stochastic programming ii: dynamic problems under risk∗
Cited in
(60)- Relationship between least squares Monte Carlo and approximate linear programming
- Comparison of least squares Monte Carlo methods with applications to energy real options
- Erratum to ``A unified approach to multiple stopping and duality
- A new class of dual upper bounds for early exercisable derivatives encompassing both the additive and multiplicative bounds
- Numerical solutions to dynamic portfolio problems with upper bounds
- Linear-quadratic control and information relaxations
- Effective sub-simulation-free upper bounds for the Monte Carlo pricing of callable derivatives and various improvements to existing methodologies
- Socially responsible merchant operations: comparison of shutdown-averse CVaR and anticipated regret policies
- Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations
- A novel decomposition-based method for solving general-product structure assemble-to-order systems
- Near-optimal asset allocation in financial markets with trading constraints
- Monte Carlo methods via a dual approach for some discrete time stochastic control problems
- Recursive lower and dual upper bounds for Bermudan-style options
- Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns
- Stochastic control with rough paths
- Mature offshore oil field development: solving a real options problem using stochastic dual dynamic integer programming
- Decomposition of convex high dimensional aggregative stochastic control problems
- Merchant commodity storage practice revisited
- Necessity of future information in admission control
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Tax-aware dynamic asset allocation
- Robust control of partially observable failing systems
- A simulation-based approach to stochastic dynamic programming
- Markov decision problems where means bound variances
- Dynamic portfolio execution and information relaxations
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
- Managing perishable inventories in retailing: replenishment, clearance sales, and segregation
- Information Relaxation and Dual Formulation of Controlled Markov Diffusions
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Approximate linear programming for networks: average cost bounds
- A unified approach to multiple stopping and duality
- Information relaxation bounds for infinite horizon Markov decision processes
- Fast estimation of true bounds on Bermudan option prices under jump-diffusion processes
- Generalized decision rule approximations for stochastic programming via liftings
- Technical note -- A note on the equivalence of upper confidence bounds and Gittins indices for patient agents
- Online allocation and pricing: constant regret via Bellman inequalities
- Dynamic learning and decision making via basis weight vectors
- Order now, pickup in 30 minutes: managing queues with static delivery guarantees
- Asymptotically optimal appointment schedules
- Approximations to stochastic dynamic programs via information relaxation duality
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Spare parts inventory management with substitution-dependent reliability
- Optimizing a portfolio of mean-reverting assets with transaction costs via a feedforward neural network
- Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
- Pricing bounds and bang-bang analysis of the Polaris variable annuities
- Pathwise dynamic programming
- Dual representations for general multiple stopping problems
- Approximate dynamic programming via iterated Bellman inequalities
- A primal-dual algorithm for BSDEs
- A FIRST‐ORDER BSPDE FOR SWING OPTION PRICING: CLASSICAL SOLUTIONS
- First order BSPDEs in higher dimension for optimal control problems
- Iterative improvement of lower and upper bounds for backward SDEs
- A first-order BSPDE for swing option pricing
- Technical Note—On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs
- Primal-Dual Regression Approach for Markov Decision Processes with General State and Action Spaces
- Dual Bounds for Periodical Stochastic Programs
- Job scheduling integrated with material ordering: decision-dependent stochastic programming and information relaxation dual bounds
- Physical vs virtual corporate power purchase agreements: meeting renewable targets amid demand and price uncertainty
- The dynamic dispatch waves problem for same-day delivery
This page was built for publication: Information relaxations and duality in stochastic dynamic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098274)
