2016
DOI: 10.1016/j.automatica.2015.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A randomized approximation algorithm for the minimal-norm static-output-feedback problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
57
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 40 publications
(57 citation statements)
references
References 32 publications
0
57
0
Order By: Relevance
“…, n) uses the Ray-Shooting Method in order to find an approximation of the global minimum of the function σ max (K) over S (0) α -the portion of S α bounded in the cone D (0) . The proof of convergence in probability of the inner-loop and its complexity (under the above mentioned assumption) can be found in [16] (see also [22]). In the inner-loop, we choose a search direction by choosing a point F in R ∞ ( )-the base of the cone D (0) .…”
Section: The Practical Algorithm For the Problem Of Lqr Via Sofmentioning
confidence: 99%
See 4 more Smart Citations
“…, n) uses the Ray-Shooting Method in order to find an approximation of the global minimum of the function σ max (K) over S (0) α -the portion of S α bounded in the cone D (0) . The proof of convergence in probability of the inner-loop and its complexity (under the above mentioned assumption) can be found in [16] (see also [22]). In the inner-loop, we choose a search direction by choosing a point F in R ∞ ( )-the base of the cone D (0) .…”
Section: The Practical Algorithm For the Problem Of Lqr Via Sofmentioning
confidence: 99%
“…Assume that K (0) ∈ int (S α ) was found by the RS algorithm (see [16]) or by any other method (see [19][20][21]). Let h > 0 and let U (0) be a unit vector w.r.t.…”
Section: The Practical Algorithm For the Problem Of Lqr Via Sofmentioning
confidence: 99%
See 3 more Smart Citations