On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
From MaRDI portal
Recommendations
- The Linear Programming Approach to Approximate Dynamic Programming
- Approximate linear programming for networks: average cost bounds
- Approximate Dynamic Programming via a Smoothed Linear Program
- Finite linear programming approximations of constrained discounted Markov decision processes
- Tetris: A study of randomized constraint sampling
Cited in
(67)- From infinite to finite programs: explicit error bounds with applications to approximate dynamic programming
- Relationship between least squares Monte Carlo and approximate linear programming
- The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
- Reductions of non-separable approximate linear programs for network revenue management
- Distributionally robust optimization
- Computational bounds for elevator control policies by large scale linear programming
- Shape constraints in economics and operations research
- Computing near-optimal policies in generalized joint replenishment
- Dynamic programming and suboptimal control: a survey from ADP to MPC
- Approximate Linear programming for a queueing control problem
- Network-based approximate linear programming for discrete optimization
- Sampling methods for multi-stage robust optimization problems
- Random projections for linear programming
- Probabilistic guarantees in robust optimization
- Random projections for linear programming: an improved retrieval phase
- Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials
- Decomposable Markov decision processes: A fluid optimization approach
- Randomized sampling for large zero-sum games
- Spare parts inventory management with substitution-dependent reliability
- Monte Carlo methods for value-at-risk and conditional value-at-risk: a review
- Data-driven optimal control with a relaxed linear program
- Simple and fast algorithm for binary integer and online linear programming
- Technical note -- Product-based approximate linear programs for network revenue management
- A new learning algorithm for optimal stopping
- Predictive stochastic programming
- A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
- Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network
- A framework and a mean-field algorithm for the local control of spatial processes
- Approximate dynamic programming for stochastic linear control problems on compact state spaces
- Linear programming and the control of diffusion processes
- Online capacity planning for rehabilitation treatments: an approximate dynamic programming approach
- Approximate dynamic programming via iterated Bellman inequalities
- Approximate dynamic programming for capacity allocation in the service industry
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Efficient global planning in large MDPs via stochastic primal-dual optimization
- Uncertain convex programs: randomized solutions and confidence levels
- Parametric scenario optimization under limited data: a distributionally robust optimization view
- Network revenue management with inventory-sensitive bid prices and customer choice
- Dynamic inventory control with payment delay and credit limit
- General feasibility bounds for sample average approximation via Vapnik-Chervonenkis dimension
- Linear programming formulation for non-stationary, finite-horizon Markov decision process models
- A bi‐level programming framework for identifying optimal parameters in portfolio selection
- A data efficient and feasible level set method for stochastic convex optimization with expectation constraints
- Ambiguous chance constrained problems and robust optimization
- Nonparametric Approximate Dynamic Programming via the Kernel Method
- Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
- Approximate linear programming for networks: average cost bounds
- Tetris: A study of randomized constraint sampling
- Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- An inexact primal-dual algorithm for semi-infinite programming
- Computing near-optimal value-at-risk portfolios using integer programming techniques
- Saddle point approximation approaches for two-stage robust optimization problems
- On safe tractable approximations of chance constraints
- Symmetric approximate linear programming for factored MDPs with application to constrained problems
- Reductions of approximate linear programs for network revenue management
- Efficient compact linear programs for network revenue management
- Efficient approximate linear programming for factored MDPs
- Scenario approximation of robust and chance-constrained programs
- Generalized maximum entropy estimation
- Partially observable Markov decision process approximations for adaptive sensing
- k-sample inference via multimarginal optimal transport
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A D.C. approximation approach for optimization with probabilistic constraints based on Chen-Harker-Kanzow-Smale smooth plus function
- Worst-case violation of sampled convex programs for optimization with uncertainty
- Genetic algorithm based technique for solving chance constrained problems
This page was built for publication: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704184)
