Efficiently computable lower bounds for the p-radius of switching linear systems.
Masaki OguraRaphaël M. JungersPublished in: CDC (2014)
Keyphrases
- linear systems
- efficiently computable
- lower bound
- upper bound
- sufficient conditions
- branch and bound
- dynamical systems
- worst case
- np hard
- objective function
- coefficient matrix
- vc dimension
- exact solution
- optimal solution
- linear combination
- computationally hard
- sparse linear systems
- global optimization
- interior point methods
- fuzzy logic
- dynamic programming