Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities

DOI10.1016/j.automatica.2006.09.020zbMath1137.93425OpenAlexW2014211039MaRDI QIDQ875498

Yasuaki Oishi

Publication date: 13 April 2007

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2006.09.020

zbMATH Keywords

optimizationcomputational complexityrandomized algorithmsstopping rulesprobabilistic solutionsparameter-dependent linear matrix inequalities

Mathematics Subject Classification ID

Related Items (14)

A survey of randomized algorithms for control synthesis and performance verification ⋮ Guaranteed cost regulator design: a probabilistic solution and a randomized algorithm ⋮ FAST—Fast Algorithm for the Scenario Technique ⋮ Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities ⋮ Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts ⋮ Probabilistic performance validation of deep learning‐based robust NMPC controllers ⋮ Computations of probabilistic output admissible set for uncertain constrained systems ⋮ A statistical learning theory approach for uncertain linear and bilinear matrix inequalities ⋮ A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs ⋮ Iterative robust control: speeding up improvement through iterations ⋮ Research on probabilistic methods for control system design ⋮ Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction ⋮ Randomized methods for design of uncertain systems: sample complexity and sequential algorithms ⋮ A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
• Several NP-hard problems arising in robust stability analysis
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples
• Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
• Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
• Uncertain convex programs: randomized solutions and confidence levels
• An ellipsoid algorithm for probabilistic robust controller design
• Feature Article—The Ellipsoid Method: A Survey
• Linear Matrix Inequalities in System and Control Theory
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Stochastic algorithms for exact and approximate feasibility of robust LMIs
• Probabilistic Design of a Robust Controller Using a Parameter-Dependent Lyapunov Function
• Common Lyapunov Functions and Gradient Algorithms
• The Scenario Approach to Robust Control Design
• Research on gain scheduling
• Probabilistic robust design with linear quadratic regulators

This page was built for publication: Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities