Positive transfer functions and convex optimization

Author

Genin, Y. ; Nesterov, Y. ; van Dooren, P.

Author_Institution

CESAME, Univ. Catholique de Louvain, Louvain-La-Neuve, Belgium

fYear

1999

fDate

Aug. 31 1999-Sept. 3 1999

Firstpage

242

Lastpage

246

Abstract

Recently, a compact characterization of scalar positive polynomials on the real line and on the unit circle was derived by Nesterov [3]. In this paper we show how to extend this result to pseudo-polynomial matrices, and also present a new proof based on the positive real lemma. The characterization is very similar to the scalar case and also allows the use of fast algorithms for computing the central point of the corresponding convex set.

Keywords

convex programming; polynomial matrices; transfer functions; convex optimization; convex set; positive real lemma; positive transfer functions; pseudopolynomial matrices; scalar positive polynomials; Control systems; Convex functions; Linear matrix inequalities; Polynomials; Robustness; Transfer functions; Transforms; Linear Matrix Inequality; Polynomial Matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (ECC), 1999 European

Conference_Location

Karlsruhe

Print_ISBN

978-3-9524173-5-5

Type

conf

Filename

7099307

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=706365