2015 54th IEEE Conference on Decision and Control (CDC) 2015
DOI: 10.1109/cdc.2015.7403370
|View full text |Cite
|
Sign up to set email alerts
|

Uniform versions of Finsler's lemma

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…This work is an extension of our previous analysis on uniform versions of Finsler's lemma [22]. Here, some new results are presented and some results from [22] were improved: the converse of Lemma 3 from [22] has been proved in Lemma 4 of this paper. Both Lemma 3 and Theorem 2 from [22] were stated for matrix-valued functions of a compact subset of R. In this paper, these results are extended for matrixvalued functions of a compact subset of R d .…”
Section: Introductionmentioning
confidence: 80%
See 3 more Smart Citations
“…This work is an extension of our previous analysis on uniform versions of Finsler's lemma [22]. Here, some new results are presented and some results from [22] were improved: the converse of Lemma 3 from [22] has been proved in Lemma 4 of this paper. Both Lemma 3 and Theorem 2 from [22] were stated for matrix-valued functions of a compact subset of R. In this paper, these results are extended for matrixvalued functions of a compact subset of R d .…”
Section: Introductionmentioning
confidence: 80%
“…In the LMI context, this allows reducing computational burden without increasing the conservatism of the solution. This work is an extension of our previous analysis on uniform versions of Finsler's lemma [22]. Here, some new results are presented and some results from [22] were improved: the converse of Lemma 3 from [22] has been proved in Lemma 4 of this paper.…”
Section: Introductionmentioning
confidence: 80%
See 2 more Smart Citations
“…e Lyapunov theory allows to write the conditions in the form of LMIs and solving them by available computational packages [14,15]. A switched Lyapunov function allows the use of slack variables which are introduced in the problem to lessen the conservativeness [16]. e control gain is recovered from the slack matrices instead of using the Lyapunov matrix.…”
Section: Introductionmentioning
confidence: 99%