The following pages link to (Q3189557):
Displaying 26 items.
- Value iteration and adaptive dynamic programming for data-driven adaptive optimal control design (Q313259) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- An online prediction algorithm for reinforcement learning with linear function approximation using cross entropy method (Q1631797) (← links)
- Optimal continuous stochastic control systems with incomplete feedback: approximate synthesis (Q1641950) (← links)
- Probabilistically distorted risk-sensitive infinite-horizon dynamic programming (Q1716491) (← links)
- Infinite horizon optimal policy for an inventory system with two types of product sharing common hardware platforms (Q1727939) (← links)
- Associative dynamic programs (Q1919588) (← links)
- Dynamic programming with state-dependent discounting (Q1995327) (← links)
- Decentralized optimization over tree graphs (Q2031996) (← links)
- Data-driven optimal control with a relaxed linear program (Q2063818) (← links)
- A stability result for linear Markovian stochastic optimization problems (Q2118100) (← links)
- The problem of controlling the linear output of a nonlinear uncontrollable stochastic differential system by the square criterion (Q2134298) (← links)
- Coase meets Bellman: dynamic programming for production networks (Q2231373) (← links)
- Robust shortest path planning and semicontractive dynamic programming (Q3120605) (← links)
- (Q4584885) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- Applications of variable discounting dynamic programming to iterated function systems and related problems (Q4621340) (← links)
- Dynamic Programming Deconstructed: Transformations of the Bellman Equation and Computational Efficiency (Q5031647) (← links)
- Some Limit Properties of Markov Chains Induced by Recursive Stochastic Algorithms (Q5037552) (← links)
- (Q5053310) (← links)
- Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)
- (Q5152162) (← links)
- Continuous-Time Robust Dynamic Programming (Q5205609) (← links)
- Regular Policies in Abstract Dynamic Programming (Q5348471) (← links)
- Analyzing Approximate Value Iteration Algorithms (Q5868951) (← links)
- Solving nonlinear and dynamic programming equations on extended \(b\)-metric spaces with the fixed-point technique (Q6103683) (← links)
