Approximate dynamic programming via iterated Bellman inequalities
From MaRDI portal
(Redirected from Publication:5256802)
Recommendations
- The Linear Programming Approach to Approximate Dynamic Programming
- Quadratic approximate dynamic programming for input-affine systems
- SPLINE APPROXIMATIONS TO VALUE FUNCTIONS
- Continuous state dynamic programming via nonexpansive approximation
- Approximate Dynamic Programming via a Smoothed Linear Program
Cites work
- A Constant Factor Approximation Algorithm for Event-Based Sampling
- A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs
- A logarithmic-time solution to the point location problem for parametric linear programming
- A Lyapunov-Like Characterization of Asymptotic Controllability
- A Price-Directed Approach to Stochastic Inventory/Routing
- Adaptive aggregation methods for infinite horizon dynamic programming
- An approximate dynamic programming approach to decentralized control of stochastic systems
- Approximate Dynamic Programming
- Basis function adaptation in temporal difference reinforcement learning
- Bounds on linear PDEs via semidefinite optimization
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Dynamic Bid Prices in Revenue Management
- Generalized polynomial approximations in Markovian decision processes
- scientific article; zbMATH DE number 1348599 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Information relaxations and duality in stochastic dynamic programs
- Interior-point methods
- Linear Matrix Inequalities in System and Control Theory
- Linear programming and sequential decisions
- Monotonicity and bounds for convex stochastic control models
- Neuro-Dynamic Programming: An Overview and Recent Results
- New linear program performance bounds for queueing networks
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Numerical Optimization
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On Performance Bounds for Uncertain Systems
- Optimality of affine policies in multistage robust optimization
- Performance bounds and suboptimal policies for linear stochastic control via LMIs
- Performance bounds for linear stochastic control
- Performance bounds for queueing networks and scheduling policies
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions
- Relaxing Dynamic Programming
- Semidefinite Programming
- Semidefinite programming relaxations and algebraic optimization in control
- Semidefinite programming relaxations for semialgebraic problems
- Spectral theory of copositive matrices
- Suboptimal control of constrained nonlinear systems via receding horizon constrained control Lyapunov functions
- Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
- Techniques for exploring the suboptimal set
- The explicit linear quadratic regulator for constrained systems
- The Linear Programming Approach to Approximate Dynamic Programming
Cited in
(24)- Performance bounds for linear stochastic control
- Value function approximation in the presence of uncertainty and inequality constraints
- State partitioning based linear program for stochastic dynamic programs: an invariance property
- Decentralized optimization over tree graphs
- Data-driven optimal control with a relaxed linear program
- A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems
- Interval iteration algorithm for MDPs and IMDPs
- Complexity bounds for approximately solving discounted MDPs by value iterations
- Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization
- Viability, viscosity, and storage functions in model-predictive control with terminal constraints
- Performance bounds and suboptimal policies for linear stochastic control via LMIs
- scientific article; zbMATH DE number 3945922 (Why is no real title available?)
- Bellman's principle of optimality and deep reinforcement learning for time-varying tasks
- On the Taylor expansion of value functions
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs
- Robust approximate bilinear programming for value function approximation
- Quadratic approximate dynamic programming for input-affine systems
- Least squares policy iteration with instrumental variables vs. direct policy search: comparison against optimal benchmarks using energy storage
- SOS-based policy iteration for H∞ control of polynomial systems with uncertain parameters
- Hybrid intelligent multi-objective optimal control of ODE-constrained nonlinear systems
- Model-free approximate dynamic programming for stochastic zero-sum games: algorithm design and analysis
- Fast and lightweight: a real-time parallelizable MPC for embedded systems
- Direct data-driven discounted infinite horizon linear quadratic regulator with robustness guarantees
- Code generation for solving and differentiating through convex optimization problems
This page was built for publication: Approximate dynamic programming via iterated Bellman inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256802)
