Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (Q1421455)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. |
scientific article; zbMATH DE number 2032803
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. |
scientific article; zbMATH DE number 2032803 |
Statements
Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (English)
0 references
26 January 2004
0 references
Stochastic gradient-type algorithms for solving parameter-dependent linear matrix inequalities are considered. Furthermore, their computational complexity is analyzed. A numerical example is given.
0 references
randomized algorithms
0 references
parameter-dependent linear matrix inequalities
0 references
computational complexity
0 references
conservatism
0 references
course of dimensionality
0 references
linear parameter-varying systems
0 references
stochastic gradient algorithms
0 references
0 references
0 references
0 references
0 references
0 references
