Stochastic algorithms for exact and approximate feasibility of robust LMIs
From MaRDI portal
Recommendations
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
- Random algorithms for solving convex inequalities
- The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
- Randomized algorithms for probabilistic robustness with real and complex structured uncertainty.
Cited in
(40)- Probabilistic design of LPV control systems.
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
- A probabilistic framework for problems with real structured uncertainty in systems and control
- 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
- Randomized algorithms for quadratic stability of quantized sampled-data systems
- Robust output-feedback controller design via local BMI optimization
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Research on probabilistic methods for control system design
- Randomized methods for design of uncertain systems: sample complexity and sequential algorithms
- A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints
- A survey of randomized algorithms for control synthesis and performance verification
- An LMI based scheduling algorithm for constrained stabilization problems
- A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
- Hard problems in linear control theory: possible approaches to their solution
- An ellipsoid algorithm for probabilistic robust controller design
- A primal--dual probabilistic setting for quadratic stability of uncertain systems
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- A new vertex result for robustness problems with interval matrix uncertainty
- On robust solutions to uncertain linear complementarity problems and their variants
- Robust stabilisation of time-varying delay systems with probabilistic uncertainties
- Statistical learning theory: a pack-based strategy for uncertain feasibility and optimization problems
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- scientific article; zbMATH DE number 4139215 (Why is no real title available?)
- Design of fault-tolerant control for MTTF
- On convex parameterization of robust control design for minimizing (conditional) performance at risk
- A statistical learning theory approach for uncertain linear and bilinear matrix inequalities
- Stochastic reformulations of linear systems: algorithms and convergence theory
- A smooth inexact penalty reformulation of convex problems with linear constraints
- The Randomized Ellipsoid Algorithm for Constrained Robust Least Squares Problems
- Probabilistic robust design with linear quadratic regulators
- Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
- The method of randomized Bregman projections for stochastic feasibility problems
- Distributed robust filtering with \(H_\infty\) consensus of estimates
- Stochastic approximation search algorithms with randomization at the input
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
This page was built for publication: Stochastic algorithms for exact and approximate feasibility of robust LMIs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540241)
