Sub- and superoptimality principles of dynamic programming revisited
From MaRDI portal
Publication:4886561
DOI10.1016/0362-546X(94)00348-LzbMath0898.90130MaRDI QIDQ4886561
No author found.
Publication date: 13 October 1998
Published in: Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)
Applications of mathematical programming (90C90) Dynamic programming in optimal control and differential games (49L20) Differential games (aspects of game theory) (91A23) Dynamic programming (90C39)
Related Items (5)
Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization ⋮ Sub- and Super-optimality Principles and Construction of Almost Optimal Strategies for Differential Games in Hilbert Spaces ⋮ Asymptotic Perron's Method and Simple Markov Strategies in Stochastic Games and Control ⋮ Incentive compatibility constraints and dynamic programming in continuous time ⋮ Quasigradient aiming strategies in optimal control problems for time-delay systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A remark on regularization in Hilbert spaces
- Optimal trajectories associated with a solution of the contingent Hamilton-Jacobi equation
- Optimal control of diffusion processes and hamilton–jacobi–bellman equations part 2 : viscosity solutions and uniqueness
- Differential games with maximum cost
- Differential Games, Optimal Control and Directional Derivatives of Viscosity Solutions of Bellman’s and Isaacs’ Equations
- Viscosity Solutions of Hamilton-Jacobi Equations
- A Uniqueness Result for Viscosity Solutions of Second Order Fully Nonlinear Partial Differential Equations
- User’s guide to viscosity solutions of second order partial differential equations
- Lower Semicontinuous Solutions of Hamilton–Jacobi–Bellman Equations
- $\mathcal{H}_\infty $ Control of Nonlinear Systems: Differential Games and Viscosity Solutions
- The existence of value in differential games
This page was built for publication: Sub- and superoptimality principles of dynamic programming revisited