January 1, 1997

Solving a class of rank minimization problems via semi-definite programs, with applications to the fixed order output feedback synthesis

Key Points

Key points are not available for this paper at this time.

Abstract

We apply certain recent results pertaining to the rank minimization problem under LMI constraints to determine non-trivial lower and upper bounds for the minimal order dynamic output feedback which stabilizes a given linear time invariant plant, via semi-definite programs.

Bookmark

Cite This Study

Mesbahi et al. (Wed,) studied this question.

synapsesocial.com/papers/6a16dccd87c007abbc0531f1 https://doi.org/https://doi.org/10.1109/acc.1997.611758

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the rank minimization problem and its control applications1998 · 67 citations
2On the rank minimization problem over a positive semidefinite linear matrix inequality1997 · 196 citations
3Matrix Analysis1985 · 10,194 citations
4Linear Matrix Inequalities in System and Control Theory1994 · 21,508 citations
5Topics in Matrix Analysis1991 · 9,502 citations

Bookmark