Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming
From MaRDI portal
Publication:5114396
DOI10.1137/19M1265065zbMath1447.93072arXiv1912.06734WikidataQ115525570 ScholiaQ115525570MaRDI QIDQ5114396
Publication date: 22 June 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.06734
Sensitivity (robustness) (93B35) Nonlinear systems in control theory (93C10) Discrete-time control/observation systems (93C55) Dynamic programming (90C39)
Related Items (3)
Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs ⋮ Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems ⋮ Robust Stability of Full Information Estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- qpOASES: a parametric active-set algorithm for~quadratic programming
- Structured regularization for barrier NLP solvers
- Norms and exclusion theorems
- Optimal infinite-horizon feedback laws for a general class of constrained discrete-time systems: Stability and moving-horizon approximations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A regularizing Levenberg - Marquardt scheme, with applications to inverse groundwater filtration problems
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- First Order Conditions for General Nonlinear Optimization
- Exponentially Accurate Temporal Decomposition for Long-Horizon Linear-Quadratic Dynamic Optimization
- A Sparsity Preserving Convexification Procedure for Indefinite Quadratic Programs Arising in Direct Optimal Control
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Exponential Decay in the Sensitivity Analysis of Nonlinear Dynamic Programming
