On avoiding vertexization of robustness problems: the approximate feasibility concept

DOI10.1109/TAC.2002.1000280MaRDI QIDQ5267191zbMATH OpenFDO

Authors B. Ross Barmish, P. S. Shcherbakov

Publication date 20 June 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2002.1000280

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Robust stability (93D09)

Cited in

(11)

• A new statistical approach for the analysis of uncertain systems
• Probabilistic design of LPV control systems.
• Statistical learning methods in linear algebra and control problems: The example of finite-time control of uncertain linear systems
• Improved synthesis method for Markov jump systems with uncertain transition rates
• Uncertain convex programs: randomized solutions and confidence levels
• Randomized algorithms for robust stability and guaranteed cost control of stochastic jump parameter systems with uncertain switching policies
• Stability and stabilization of Markov jump systems with generally uncertain transition rates
• Research on probabilistic methods for control system design
• A primal--dual probabilistic setting for quadratic stability of uncertain systems
• Probabilistic robust design with linear quadratic regulators
• Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities

This page was built for publication: On avoiding vertexization of robustness problems: the approximate feasibility concept

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267191)