Pages that link to "Item:Q4540241"

The following pages link to Stochastic algorithms for exact and approximate feasibility of robust LMIs (Q4540241):

Displaying 35 items.

• A statistical learning theory approach for uncertain linear and bilinear matrix inequalities (Q458858) (← links)
• Distributed robust filtering with \(H_\infty\) consensus of estimates (Q629034) (← links)
• Stochastic approximation search algorithms with randomization at the input (Q747226) (← links)
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities (Q875498) (← links)
• Probabilistic design of LPV control systems. (Q1410356) (← links)
• Recursive algorithms for inner ellipsoidal approximation of convex polytopes. (Q1413940) (← links)
• Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (Q1421455) (← links)
• A probabilistic framework for problems with real structured uncertainty in systems and control (Q1614384) (← links)
• Uncertain convex programs: randomized solutions and confidence levels (Q1769067) (← links)
• Randomized algorithms for robust stability and guaranteed cost control of stochastic jump parameter systems with uncertain switching policies (Q1774045) (← links)
• Randomized algorithms for quadratic stability of quantized sampled-data systems (Q1879595) (← links)
• Robust output-feedback controller design via local BMI optimization (Q1883118) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
• Research on probabilistic methods for control system design (Q2276096) (← links)
• Randomized methods for design of uncertain systems: sample complexity and sequential algorithms (Q2342767) (← links)
• A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints (Q2342779) (← links)
• A survey of randomized algorithms for control synthesis and performance verification (Q2371305) (← links)
• A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs (Q2477698) (← links)
• Hard problems in linear control theory: possible approaches to their solution (Q2487588) (← links)
• An ellipsoid algorithm for probabilistic robust controller design (Q2503519) (← links)
• A primal--dual probabilistic setting for quadratic stability of uncertain systems (Q2503603) (← links)
• Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction (Q2512100) (← links)
• A new vertex result for robustness problems with interval matrix uncertainty (Q2519738) (← links)
• On Robust Solutions to Uncertain Linear Complementarity Problems and their Variants (Q2828336) (← links)
• Robust stabilisation of time-varying delay systems with probabilistic uncertainties (Q2828756) (← links)
• Statistical Learning Theory: A Pack-based Strategy for Uncertain Feasibility and Optimization Problems (Q3053993) (← links)
• Design of fault-tolerant control for MTTF (Q3548700) (← links)
• On convex parameterization of robust control design for minimizing (conditional) performance at risk (Q3626933) (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
• A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
• Probabilistic robust design with linear quadratic regulators (Q5941461) (← links)
• Discussion on: ``GPC robust design using linear and/or bilinear matrix inequalities'' (Q5965608) (← links)
• Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966130) (← links)
• The method of randomized Bregman projections for stochastic feasibility problems (Q6156125) (← links)