Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
From MaRDI portal
(Redirected from Publication:608445)
Recommendations
- The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- An ellipsoid algorithm for probabilistic robust controller design
- Stochastic algorithms for robustness of control performances
Cites work
- scientific article; zbMATH DE number 4014909 (Why is no real title available?)
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- A class of rank-two ellipsoid algorithms for convex programming
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- A probabilistic framework for problems with real structured uncertainty in systems and control
- An ellipsoid algorithm for probabilistic robust controller design
- Family of algorithms for solving convex programming problems
- Feature Article—The Ellipsoid Method: A Survey
- Guaranteed cost regulator design: a probabilistic solution and a randomized algorithm
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Modifications and implementation of the ellipsoid algorithm for linear programming
- On square roots of M-matrices
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- Probabilistic design of LPV control systems.
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty.
- The uniform distribution: A rigorous justification for its use in robustness analysis
Cited in
(2)
This page was built for publication: Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608445)