×

zbMATH — the first resource for mathematics

Duality and eventually periodic systems. (English) Zbl 1100.93019
Summary: This paper employs semidefinite programming duality theory to develop new alternative linear matrix inequality (LMI) tools for eventually periodic systems. These tools are then utilized to rederive an important version of the Kalman-Yakubovich-Popov (KYP) Lemma for such systems, and further give new synthesis results.

MSC:
93B51 Design techniques (robust design, computer-aided design, etc.)
90C22 Semidefinite programming
93B40 Computational methods in systems theory (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Farhood, Systems and Control Letters 47 pp 417– (2002)
[2] Balakrishnan, IEEE Transactions on Automatic Control 48 pp 30– (2003)
[3] Farhood, Proceedings of the American Control Conference 3 pp 2021– (2004)
[4] Ramana, SIAM Journal on Optimization 7 pp 641– (1997)
[5] Todd, Acta Numerica 10 pp 515– (2001)
[6] Vandenberghe, SIAM Review 38 pp 49– (1996)
[7] Semidefinite Programming for Combinatorial Optimization. Habilitations-schrift: Berlin-Dahlem, Germany, 2000.
[8] . Convex Optimization. Cambridge University Press: Cambridge, 2004. · Zbl 1058.90049
[9] Optimization by Vector Space Methods. Wiley: New York, 1969.
[10] Gahinet, International Journal of Robust and Nonlinear Control 4 pp 421– (1991)
[11] Iwasaki, Automatica 30 pp 1307– (1994)
[12] Packard, Systems and Control Letters 22 pp 79– (1994)
[13] Dullerud, IEEE Transactions on Automatic Control 44 pp 1486– (1999)
[14] . Linear Robust Control. Prentice-Hall: Englewood Cliffs, NJ, 1995.
[15] Rantzer, Systems and Control Letters 28 pp 7– (1996)
[16] Meinsma, IEEE Transactions on Automatic Control 42 pp 1032– (1997)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.