Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes
From MaRDI portal
Publication:6116235
DOI10.1137/22m149185xzbMath1522.90245OpenAlexW4384203266MaRDI QIDQ6116235
Publication date: 11 August 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m149185x
Cites Work
- Unnamed Item
- Unnamed Item
- Policy iteration for robust nonstationary Markov decision processes
- A forecast horizon and a stopping rule for general Markov decision processes
- Finite dimensional approximation in infinite dimensional mathematical programming
- Solvability in infinite horizon optimization
- Solving nonstationary infinite horizon dynamic optimization problems
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Infinite Horizon Production Planning in Time-Varying Systems with Convex Production and Inventory Costs
- The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
- A Shadow Simplex Method for Infinite Linear Programs
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- Infinite Horizon Production Scheduling in Time-Varying Systems Under Stochastic Demand
- Optimal Capacity Expansion Over an Infinite Horizon
- A New Optimality Criterion for Nonhomogeneous Markov Decision Processes
- Infinite Horizon Optimization
- Rolling Horizon Procedures in Nonhomogeneous Markov Decision Processes
- Finite horizon approximations of infinite horizon linear programs
- Approximation Schemes for Infinite Linear Programs
- Equipment replacement under technological change
- From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming
- On the Asymptotic Optimality of Finite Approximations to Markov Decision Processes with Borel Spaces
- Technical Note—Identifying Forecast Horizons in Nonhomogeneous Markov Decision Processes
- Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
- A Simplex Method for Countably Infinite Linear Programs
- A Linear Programming Approach to Nonstationary Infinite-Horizon Markov Decision Processes
- Simplex Algorithm for Countable-State Discounted Markov Decision Processes
- Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
