Differential stability of convex discrete optimal control problems with possibly empty solution sets
DOI10.1080/02331934.2020.1836637zbMath1495.49017OpenAlexW3093613935MaRDI QIDQ5090285
Publication date: 18 July 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1836637
conjugate functionoptimal value function\( \varepsilon \)-subdifferentials\(\varepsilon\)-normal directionsconvex discrete optimal control problem
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Discrete-time control/observation systems (93C55) Optimality conditions for problems involving relations other than differential equations (49K21)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on differential stability of convex optimization problems
- Mordukhovich subgradients of the value function to a parametric discrete optimal control problem
- Subgradients of marginal functions in parametric mathematical programming
- Subgradients of the optimal value function in a parametric discrete optimal control problem
- Multiobjective model predictive control
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
- Calculus rules for global approximate minima and applications to approximate subdifferential calculus
- Differential stability of convex discrete optimal control problems
- Differential stability of convex optimization problems with possibly empty solution sets
- Subgradients of value functions in parametric dynamic programming
- Hamilton-Jacobi theory and parametric analysis in fully convex problems of optimal control
- Calculus Without Derivatives
- Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
- Subgradients of Optimal-Value Functions in Dynamic Programming: The Case of Convex Systems Without Optimal Paths
- Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
- Differential stability of convex optimization problems under inclusion constraints
- On the Subdifferentiability of Convex Functions
This page was built for publication: Differential stability of convex discrete optimal control problems with possibly empty solution sets
