2006
DOI: 10.3166/ejc.12.40-56
|View full text |Cite
|
Sign up to set email alerts
|

Multi-objective Synthesis Using LMI Formulations for Application of the Cutting Plane Algorithm

Abstract: The problem of designing a controller to meet different specifications or deciding that no such controller exists is addressed in this paper by linking three types of tools: the Youla parameterization allows searching for a controller in a convex set; formulations using Linear Matrix Inequalities (LMI) are proposed for different practical specifications; the corresponding convex problem is solved using a Cutting Plane Algorithm (CPA). Such an approach is developed by overcoming the problem of the huge number o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…Only the expression of the LMI for each constraint is given without specifying the procedure to get them, except for the delay margin: the derivation of the other constraints are presented in Ref. 13.…”
Section: Translation Of the Manufacturer Objectives Into Lmi Consmentioning
confidence: 99%
See 4 more Smart Citations
“…Only the expression of the LMI for each constraint is given without specifying the procedure to get them, except for the delay margin: the derivation of the other constraints are presented in Ref. 13.…”
Section: Translation Of the Manufacturer Objectives Into Lmi Consmentioning
confidence: 99%
“…According to a slightly modified version of the Kalman-Yakubovich-Popov (KYP) lemma, 13 the closed-loop constraint σ(G zw ) < γ is satisfied for all s = jω in [jω 1 , jω 2 ] if and only if one of the two following equivalent propositions holds:…”
Section: Application Of the Cpamentioning
confidence: 99%
See 3 more Smart Citations