The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
From MaRDI portal
Publication:5201301
Recommendations
- An ellipsoid algorithm for probabilistic robust controller design
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
Cited in
(11)- LMI approximations for the radius of the intersection of ellipsoids: Survey.
- A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
- An ellipsoid algorithm for probabilistic robust controller design
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- scientific article; zbMATH DE number 5952223 (Why is no real title available?)
- Research on probabilistic methods for control system design
- scientific article; zbMATH DE number 1748554 (Why is no real title available?)
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
This page was built for publication: The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5201301)