Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
From MaRDI portal
Publication:608445
DOI10.1016/j.automatica.2010.05.008zbMath1205.93171OpenAlexW2023934260MaRDI QIDQ608445
Yasumasa Fujisaki, Takayuki Wada
Publication date: 25 November 2010
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2010.05.008
robust controlrandomized algorithmsparameter-dependent linear matrix inequalitiesprobabilistic robustnessrobust feasibility problemsstochastic ellipsoid methods
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Guaranteed cost regulator design: a probabilistic solution and a randomized algorithm
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- On square roots of M-matrices
- The uniform distribution: A rigorous justification for its use in robustness analysis
- Probabilistic design of LPV control systems.
- A probabilistic framework for problems with real structured uncertainty in systems and control
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- An ellipsoid algorithm for probabilistic robust controller design
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
- Lectures on Modern Convex Optimization
- A class of rank-two ellipsoid algorithms for convex programming
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- Modifications and implementation of the ellipsoid algorithm for linear programming
This page was built for publication: Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts