Pages that link to "Item:Q5256802"

The following pages link to Approximate dynamic programming via iterated Bellman inequalities (Q5256802):

Displaying 18 items.

• Performance bounds for linear stochastic control (Q1016592) (← links)
• Value function approximation in the presence of uncertainty and inequality constraints (Q1350642) (← links)
• State partitioning based linear program for stochastic dynamic programs: an invariance property (Q1939695) (← links)
• Decentralized optimization over tree graphs (Q2031996) (← links)
• Data-driven optimal control with a relaxed linear program (Q2063818) (← links)
• A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems (Q2286914) (← links)
• Interval iteration algorithm for MDPs and IMDPs (Q2636515) (← links)
• Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
• Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization (Q2664400) (← links)
• Viability, viscosity, and storage functions in model-predictive control with terminal constraints (Q2665391) (← links)
• Performance bounds and suboptimal policies for linear stochastic control via LMIs (Q3098498) (← links)
• (Q3716866) (← links)
• Bellman's principle of optimality and deep reinforcement learning for time-varying tasks (Q5043501) (← links)
• On the Taylor Expansion of Value Functions (Q5131481) (← links)
• Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
• Quadratic approximate dynamic programming for input‐affine systems (Q5409145) (← links)
• Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage (Q5882386) (← links)
• SOS-based policy iteration for <i>H_∞</i> control of polynomial systems with uncertain parameters (Q6105557) (← links)