A unified algebraic approach to linear control design: Robert E. Skelton, Tetsuya Iwasaki and Karolos M. Grigoriadis; Copyright Taylor & Francis, 1998, ISBN: 0-7484-0592-5

By Takao Watanabe. at - Automatisierungstechnik, 2003

1,075 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Control and Systems Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/0ebb66cb65651993d0329d8d1001005b9df25f70

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Control and Systems Engineering

In Numerical Analysis

Citations in the corpus

Variance-constrained filtering for uncertain stochastic systems with missing measurements (2003, methodology): “851124 On the other hand, the covariance control theory has provided a more direct methodology for achieving the individual variance constraints than the LQG control theory, see [19] and references therein.”
Technical Communique: New dilated LMI characterizations for continuous-time multiobjective controller synthesis (2004, neutral): “Although we have proved Lemma 1 based on the Schur complement technique, the equivalence of (i) and (ii) can also be shown by the Elimination Lemma (Gahinet & Apkarian, 1994; Iwasaki & Skelton, 1994; Skelton et al., 1997).”
Foundations of Free Noncommutative Function Theory (2012, background): “, [74, 73, 98] — in the context of noncommutative convexity and noncommutative real semialgebraic geometry, where one considers polynomials and rational functions in d noncommuting indeterminates evaluated on d-tuples of matrices over R [49, 56, 59, 58, 54, 57].”
gain analysis for switched systems with continuous-time and discrete-time subsystems (2005, neutral): “Lemma 1 (Boyd et al. 1994, Iwasaki et al. 1998): Consider the continuous-time system _xðtÞ ¼ AcxðtÞ þ BcwðtÞ zðtÞ ¼ CcxðtÞ þDcwðtÞ, ð4Þ where x(t), w(t) and z(t) are the same as in (1), and Ac, Bc, Cc, Dc are constant matrices of appropriate dimensions.”
Matrix Inequalities: A Symbolic Procedure to Determine Convexity Automatically (2003, background): “In the last few years, the approaches that have been proposed in the field of optimization and control theory based on linear matrix inequalities and semidefinite programming have become very important and promising, since the same framework can be used for a large set of problems ([ SIG97 , BEGFB94”
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization (2007, background): “For the general case, a variety of heuristic algorithms based on local optimization, including alternating projections [31] and alternating LMIs [45], have been proposed.”
Differentially Private Filtering (2012, background): “Then the constraint (17) can be rewritten and is satisfied if and only if there exists a matrix , of the same dimensions as , such that [31]”
NONCOMMUTATIVE CONVEXITY ARISES FROM LINEAR MATRIX INEQUALITIES. (2006, background): “This is because many linear systems problems convert directly into matrix inequalities [33].”
LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future (2012, background): “The literature on the subject is quite vast, and we only mention the pioneering book [40], the surveys [52] and [39], and the book [51] for applications to systems and control.”
Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices (2003, methodology): “Various heuristics have been developed to handle problems of this type, specially in the context of low-order controller design; see, e.g., [BG96, SIG98 , Dav94].”