A reachability-analysis method on projected gradient descent dynamics produces certified outer approximations to the minimizer sets of strongly convex programs whose costs depend on bounded uncertain parameters.
System Level Synthesis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A robustly constrained Nash equilibrium is defined and computed via iterative best response for dynamic games with state-dependent noise and nonlinear constraints using system-level synthesis.
citing papers explorer
-
Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
A reachability-analysis method on projected gradient descent dynamics produces certified outer approximations to the minimizer sets of strongly convex programs whose costs depend on bounded uncertain parameters.
-
Robustly Constrained Dynamic Games for Uncertain Nonlinear Dynamics
A robustly constrained Nash equilibrium is defined and computed via iterative best response for dynamic games with state-dependent noise and nonlinear constraints using system-level synthesis.