The following pages link to (Q3755250):
Displaying 12 items.
- A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces (Q330284) (← links)
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions (Q613579) (← links)
- Adaptive control of Markov processes with incomplete state information and unknown parameters (Q1071659) (← links)
- Reduced complexity dynamic programming based on policy iteration (Q1206904) (← links)
- Nearly optimal policies in risk-sensitive positive dynamic programming on discrete spaces. (Q1403168) (← links)
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
- Optimal adaptive policies for sequential allocation problems (Q1922542) (← links)
- Adaptive policies for stochastic systems under a randomized discounted cost criterion (Q1959062) (← links)
- Off-policy based adaptive dynamic programming method for nonzero-sum games on discrete-time system (Q2198700) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes (Q3984139) (← links)
- The Compactness of a Policy Space in Dynamic Programming Via an Extension Theorem for Carathéodory Functions (Q4346231) (← links)
