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

Robust output-feedback controller design via local BMI optimization

Abstract: The problem of designing a globally optimal full-order output-feedback controller for polytopic uncertain systems is known to be a non-convex NP-hard optimization problem, that can be represented as a bilinear matrix inequality optimization problem for most design objectives. In this paper a new approach is proposed to the design of locally optimal controllers. It is iterative by nature, and starting from any initial feasible controller it performs local optimization over a suitably defined non-convex function… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
114
0
2

Year Published

2005
2005
2021
2021

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 173 publications
(118 citation statements)
references
References 55 publications
2
114
0
2
Order By: Relevance
“…The second part deals with the control design where such methods are applied towards objective optimization. At several places in control design literature it can be read that coordinate descent methods are not guaranteed to converge (Kanev et al (2004); Iwasaki (1999); Yamada and Hara (1998)). However no explanations are given for this, although such methods can only improve or maintain the objective.…”
Section: Lmi-based Coordinate Descent Methodsmentioning
confidence: 99%
“…The second part deals with the control design where such methods are applied towards objective optimization. At several places in control design literature it can be read that coordinate descent methods are not guaranteed to converge (Kanev et al (2004); Iwasaki (1999); Yamada and Hara (1998)). However no explanations are given for this, although such methods can only improve or maintain the objective.…”
Section: Lmi-based Coordinate Descent Methodsmentioning
confidence: 99%
“…In particular, the algorithm can converge to a saddle point when one exists. An alternative iterative approach to linear cost optimisation problems with bi-affine constraints was recently established in [21]. The approach involves the local optimisation of suitable non-convex functions at each step and enjoys local convergence under certain conditions.…”
Section: Algorithmmentioning
confidence: 99%
“…The optimisation problem (49) contains a Bilinear Matrix Inequality (BMI) (Kanev, Scherer, Verhaegen, & De Schutter, 2004;VanAntwerp & Braatz, 2000) whose size is 2(n + m + N + n 1 + n 2 ).…”
Section: Robust Fwl Controller Designmentioning
confidence: 99%
“…A large FWL tolerance means that the resulting controller can be implemented with a processor of short word length. Combining (23), (27), (29), (30), (36), (47) and (48), the above design problem can also be expressed aswhereThe optimisation problem (49) contains a Bilinear Matrix Inequality (BMI) (Kanev, Scherer, Verhaegen, & De Schutter, 2004;VanAntwerp & Braatz, 2000) whose size is 2(n + m + N + n 1 + n 2 ).In the work Yang et al (2001), an FWL H 2 controller design problem is studied which is also formulated as a BMI optimisation problem. However, as the method proposed in Yang et al (2001) examines each vertice of the FWL perturbation hypercube D β , the related optimisation problem contains at least 2 N BMIs of a size no less than 4n.…”
mentioning
confidence: 99%