scientific article; zbMATH DE number 7626790
From MaRDI portal
Publication:5053310
Chin Pang Ho, Wolfram Wiesemann, Marek Petrik
Publication date: 6 December 2022
Full work available at URL: https://arxiv.org/abs/2006.09484
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast projection onto the simplex and the \(l_1\) ball
- A new polynomial-time algorithm for linear programming
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Bounded-parameter Markov decision processes
- Robust MDPs with k-Rectangular Uncertainty
- Sparse Optimization with Least-Squares Constraints
- The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes
- Modified Policy Iteration Algorithms for Discounted Markov Decision Problems
- On the Convergence of Policy Iteration in Stationary Dynamic Programming
- Markov Decision Processes with Imprecise Transition Probabilities
- Markovian Decision Processes with Uncertain Transition Probabilities
- 10.1162/1532443041827907
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Robust Markov Decision Processes
- Robust Control of Markov Decision Processes with Uncertain Transition Matrices
- Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
- Convex Analysis
- Robust Dynamic Programming
- Linear programming. Foundations and extensions
This page was built for publication:
