Olivier Bachelier 3. Michael Sebek 4;5. Abstract. polynomial matrix to belong to a given region D of the complex plane.

Size: px
Start display at page:

Download "Olivier Bachelier 3. Michael Sebek 4;5. Abstract. polynomial matrix to belong to a given region D of the complex plane."

Transcription

1 D-Stability of Polynomial Matrices 1 Didier Henrion ; Olivier Bachelier Michael Sebek ; Abstract Necessary and sucient conditions are formulated for the zeros of an arbitrary polynomial matrix to belong to a given region D of the complex plane. The conditions stem from a general optimization methodology mixing LFRs, rank-one LMIs and the S-procedure. They are expressed as an LMI feasibility problem that can be tackled with widespread powerful interior-point methods. Most importantly, the D-stability conditions can be combined with other LMI conditions arising in robust stability analysis. Keywords Polynomial Matrix, D-stability, LMI. 1 Introduction Polynomial matrices play a central role in modern systems theory. Algebraic methods such as the polynomial approach [] or the behavioral approach [] heavily rely upon polynomial matrices. Unsurprisingly, fundamental system features are captured by properties of polynomial matrices. For example, the zeros of the denominator polynomial matrix in a matrix fraction description [] characterize system dynamics and performance. Satisfactory transient time response can be ensured as soon as the zeros are located in some specic region of the complex plane [1]. The present paper is precisely concerned with 1 This work was supported by the Barrande Project No. 9/00-9/0, by the Grant Agency of the Czech Republic under contract No. 10/99/18 and by the Ministry of Education of the Czech Republic under contract No. VS9/0. Corresponding author. henrion@laas.fr. FAX LAAS-CNRS, Avenue du Colonel Roche, 1 0 Toulouse, Cedex, France. Institute of Information Theory and Automation, Academy of Sciences of the Czech Republic, Pod vodarenskou vez, Prague 8, Czech Republic. Trnka Laboratory for Automatic Control, Faculty of Electrical Engineering, Czech University of Technology, Technicka, 1 Prague, Czech Republic. 1

2 checking whether the zeros of a given polynomial matrix belong to a given region D. Following a terminology introduced in [], this problem is henceforth referred to as the D-stability problem. In the special case of polynomials, i.e. scalar polynomial matrices, assessing stability is a long-standing problem that has motivated a lot of work since the last century. In order to check D-stability in the left-half plane (for continuous-time systems), in the unit disk (for discrete-time systems) or in more general regions (for ensuring system performance), two approaches may be pursued. One can alternatively Compute the zeros of the polynomial, see [8] for a recent survey and [8] for promising new developments. A standard way to proceed consists in computing the eigenvalues of the companion matrix associated to the polynomial, using for example the numerically stable Schur decomposition [1]; Use indirect methods such as the determinantal Routh-Hurwitz or Schur-Cohn criteria or the quadratic Hermite-Fujiwara criterion, see [1]. The case of polynomial matrices is far more involved. Considering square non-singular matrices only, we can basically distinguish between two approaches to D-stability. One can alternatively First, compute the determinant of the polynomial matrix [0], which may be numerically dicult although signicant progress has been reported recently [0, 1]. Second, use one of the two methods depicted above on the resulting scalar polynomial; Compute the zeros of the polynomial matrix [0]. Here also, a standard technique is to compute the eigenvalues of the pencil matrix associated to the polynomial matrix [], using for example the numerically stable QZ decomposition [1]. As pointed out in [8], some numerical diculties may be expected with high multiplicity zeros. Considering rectangular polynomial matrices, the only method we are aware of was reported in [] and makes indirect use of state-space arguments for computing the zeros. Note that, up to the authors' knowledge, there is no satisfactory extension of the scalar indirect methods to the matrix case. Some attempts were reported to extend the Hermite- Fujiwara criterion [] or the Routh-Hurwitz criterion [9] to polynomial matrices, but no unied approach has appeared so far. Finally, let us point out that the problem of checking stability of polynomial matrices is dicult enough to motivate the development of potentially conservative stability conditions that do not require the computation of the determinant [, ]. Note also that these conditions are only valid for checking stability in the unit disk. In view of this unsatisfactory state of the art, this paper is an attempt to overcome the lack of suciently general methods for studying stability of polynomial matrices without performing tedious determinant computations or numerically hazardous evaluations of the

3 zeros. The approach we pursue is based on an idea that originally appeared in []. The stability problem for polynomial matrices is rst expressed as an optimization problem. Then, several techniques are used to come up with a standard formulation of the problem. The basic concepts we hinge upon are Linear Fractional Representations (LFRs, see [8]), rank-constrained Linear Matrix Inequalities (LMIs, see []), the S-procedure [] and semidenite programming []. The strengths of our method are enumerated below Rectangular polynomial matrices with real or complex coecients can be handled; Covered stability regions include half-planes, disks, parabolas or their non-convex complements or possibly non-connected unions, not necessarily symmetric with respect to the real axis; The stability conditions are expressed as an LMI, a linear feasibility problem over the cone of positive denite matrices [] that can be solved through powerful interiorpoint methods []; Most importantly, the stability conditions can be combined with other conditions of similar type arising in robust stability analysis problems, when some elements in the polynomial matrix are uncertain. This extension will be covered elsewhere. The outline of the paper is as follows. In Section, we state the D-stability problem to be solved. The stability regions covered by our approach are described in Section. A convex LMI formulation of the stability conditions is derived in Section. This is our main result. In Section, several examples are provided to illustrate the method. Finally, the paper winds up with some concluding remarks and directions for future research. Notations R and C are the sets of real and complex numbers, respectively. s? = x? jy is the complex conjugate of the complex number s = x + jy. A? (s) is the transpose conjugate of the complex polynomial matrix A(s) in the indeterminate s. I n denotes the identity matrix of dimension n. TraceA is the trace of matrix A. RankA is the rank of matrix A. The matrix inequalities A B and A B mean that matrix A?B is positive denite and positive semidenite, respectively. A B stands for the Kronecker product of two matrices A and B. Finally, (A) and (A) denote the number of positive and negative eigenvalues of a Hermitian matrix A = A?, respectively. Problem Statement Suppose we are given an m n complex polynomial matrix A(s) = A 0 + A 1 s + + A d s d of degree d together with a region of the complex plane. D C

4 A zero of A(s) is usually dened [] as a complex value z C for which the rank of A(s) drops below its normal value, i.e. RankA(z) < RankA(s) Without computing the determinant or the zeros of A(s), we aim at nding necessary and sucient conditions for D-stability of A(s), i.e. for the zeros of A(s) to belong to D. Stability Regions First we describe the class of regions D we will consider throughout the paper. Dene D C = fs C s = Dg C as the complement of region D in C. In this paper, we restrict our attention to regions D whose complement reads D C = fs C B 00 + B 10 s + B 01 s? + B 11 ss? 0g (1) where matrices B gh C kk are such that non-singular matrix B B = B? 00 B = 01 B 10 B 11 () has at least one negative eigenvalue, i.e. (B) > 0. The motivation behind this particular choice will become apparent shortly. In Sections.1 and. we show that the class of regions dened above encompasses a wide variety of typical clustering regions. In Section. we show that we can describe at a given accuracy any region of the complex plane, even non-convex or non-connected ones. In Section., we enumerate simple transformations (scalings, translations, rotations and Mobius mapping) that can be applied to our regions. In Section. an important point is raised about open regions and zeros at innity. Finally, in Section. we highlight some links between our representation and standard clustering regions encountered in the literature..1 First Order Regions Let k = 1. We can dene three dierent regions in this case. Half-plane D = fx + jy C ax + by + c < 0g with a; b; c R and B = c a + jb a? jb 0

5 Disk interior D = fs C js? s 0 j < rg with s 0 C, r > 0 R and B =?r + s 0 s? 0?s 0?s? 0 1 Disk exterior D = fs C js? s 0 j > rg with s 0 C, r > 0 R and r B =? s 0s? 0 s 0 s? 0?1. Second Order Regions When k =, we can describe the following useful regions. Ellipsoid D = fx + jy C a (x? x 0 ) + b (y? y 0 ) < 1g with a; b; x 0 ; y 0 R and B = B = (a x 0 + b y 0? 1) 0?(a x 0 + jb y 0 ) 1 0 1=(b? a ) 1 0?(a x 0? jb y 0 ) 1 b (a x + 0 b y 0? 1) 0?(a x 0 + jb y 0 ) j 0 1=(a? b ) j 0?(a x 0? jb y 0 )?j a 0?j Parabola D = fx + jy C x + x 0 + a y < 0g with a; x 0 ; y 0 R and B = x 0 0 a 0 1 a 0 a a 0 a when a < b ; when a > b A wide variety of other regions can be described when k =, but they are generally irrelevant as far as zero clustering is concerned.. Union of Regions The regions mentioned above are connected. Such regions shall cover many practical problems but some specic investigations require more sophisticated regions such as unions of possibly disjoint subregions. This is particularly true when one wants to test the transient performances of a multi-time scale system. It would be quite inappropriate to check stability in a convex region containing the whole of dynamics. For instance, if a system has two separate dynamics, it is more judicious to choose D as a union of two disjoint subregions, one for the fast poles and the other one for the slow poles. As another

6 example, the damping factor induced by a couple of dominant complex eigenvalues may be handled with a couple of disjoint subregions (such as disks or ellipses) symmetric to each other with respect to the real axis. Actually, our formulation can easily handle union of regions. To see this, note that the intersection of two complementary regions D C i = fs C B 00 i + B 10 i s + B 01 for i = 1; is a complementary region D C = fs C B B B 00 0 B 10 s+ i s? + B 11 B 01 i B 01 ss? 0g B s? B 11 ss? 0g Therefore, s D 1 or s D if and only if s D, where D is the union of D 1 and D. This property holds for any arbitrary number of regions. Consequently, we can describe any union of the regions introduced in Sections.1 and., such as half-planes or disks. Since any region of the complex plane can be represented by the union of half-planes and disks at any desired accuracy, we conclude that the regions described in this paper are dense in the set of regions of the complex plane. These regions may be open, non-convex or even non-connected. Note however that our formulation cannot easily handle intersection of regions. This is believed to be the major hurdle of our approach. For example, we were not able to nd a suitable expression for describing a conic sector in the left half-plane, a typical clustering region.. Transformation of Regions The basic geometric transformations that can be carried out to enlarge the class of regions covered by our formulation are enumerated next. Scaling ks where k R matrix B becomes B 00 k?1 B 01 k?1 B 10 k? B 11 Translation s + t where t C matrix B becomes B 00?? tb10 t? B 01 + tt? B 11 B 01? tb 11 B 10? t? B 11 B 11 Rotation e j s where 0 < matrix B becomes B 00 e j B 01 e?j B 10 B 11 Mobius mapping (a + bs)=(c + ds) where a; b; c; d R matrix B becomes b B 00? ab(b 10 + B 01 ) + a B 11?bdB 00? abb 10 + bcb 01? acb 11?bdB 00 + bcb 10? abb 01? acb 11 d B 00? cd(b 10 + B 01 ) + c B 11

7 . Zeros at Innity Special care must be taken when studying stability of polynomial matrices in open regions such as disk complements or half-planes. This is because polynomial matrices generally feature zeros at innity, i.e. when ss?! 1. The reader is referred to [] for an accurate denition and a comprehensive treatment of zeros at innity. As an example, just consider stability in the left half-plane. One traditionally says that a polynomial matrix is stable in the continuous-time sense if and only if its zeros are located in the left half-plane. However, this sentence refers to nite zeros only. Indeed, a stable polynomial matrix may have zeros located in the right half-plane, provided these zeros are at innity. When studying stability in open regions, it may thus be necessary to exclude innite zeros of polynomial matrices. For instance, when studying stability in the left half-plane D = fs C s + s? < 0g, the complementary right half-plane D C = fs C s + s? 0g may be replaced by the half disk D C r = fs C s + s? 0; ss? r g for a suciently large r R. Innite zeros may belong to open regions D and D C, but denitely do not belong to bounded region D C r for nite r.. Relation to Standard Stability Regions..1 -Regions -regions, proposed in [1], are described by the so-called polynomial formulation D = fs C X e;f B ef s e (s? ) f < 0g where e; f are integers such that e 0,f 0 and e + f d. Integer d is called the order of the region. In most practical problems we encounter rst order regions (d = 1) such as half-planes or second order regions (d = ) such as disks, ellipses, hyperbolas, parabolas, as well as vertical and horizontal strips. It must be noticed that our complementary description (1) of stability regions can always be written as a nite set of -regions. It suces to enumerate the set of determinantal minors of the matrix expression in (1) to see that non-negativity of each minor can be expressed as an -region... LMI Regions -regions are not always convenient because of possible nonlinearities or even nonconvexities. That is why a more recent formulation of regions has been recently introduced in

8 [9, 10] and widely used afterwards. The formulation of a LMI region is as follows D = fs C B 00 + B 10 s + B 01 s? 0g where B 00 = (B 00 )? R dd and B 10 = (B 01 )? R dd are given matrices. Integer d is called the order of the LMI region. LMI regions are symmetric with respect to the real axis. The set of rst order LMI regions corresponds to vertical half-planes while second order LMI regions include disks, ellipses, classical and hyperbolic sectors, vertical and horizontal strips. The set of LMI regions is dierent from the set of -regions since an -region is not necessarily convex. Actually, none of these sets includes the other one and both can be of great practical interest. The LMI formulation can sometimes be obtained from the polynomial formulation by applying Schur complement. This can be seen as a way to reduce the degree of the scalar inequality by turning it into a matrix inequality. Note nally that many unions of possibly disjoint and non-symmetric convex LMI subregions can be formulated as generalized LMI regions, an extension of LMI regions [9, ]. Our complementary region D C dened in equation (1) reduces to an LMI region, provided B 11 = 0. In this case, region D is a (possibly non-convex) complementary LMI region. LMI Formulation of the Problem Following these preliminaries, we can now derive an LMI formulation of a necessary and sucient condition for D-stability of a polynomial matrix A(s). In the sequel, it is assumed that A(s) has full column-rank. If the input matrix has full row-rank, then we work on its transpose. The main steps of our approach can be sketched as follows. In Section.1, we show that checking stability amounts to solving an optimization problem. Using LFRs, we derive a rank-one LMI formulation of this problem in Section., and an equivalent quadratic programming formulation in Section.. Then we use the S-procedure in Section. to show that the non-convex rank constraint can actually be dropped, leading to a tractable LMI formulation of stability conditions..1 Optimization Problem If z C is a zero of an m n full column-rank polynomial matrix A(s), then there exists a non-zero vector x C n such that A(z)x = 0 Consequently, all the zeros of A(s) belong to D if and only if the optimal value of the optimization problem = min x? A? (s)a(s)x st s D C () 8

9 is such that > 0. It is assumed that vector x is non-zero in problem ().. Rank-one LMI Problem Now we show that solving optimization problem () amounts to solving a rank-one LMI optimization problem. We shall use the following important result. Lemma 1 Polynomial matrix A(s) has the following Linear Fractional Representation (LFR) A(s) = A 0 + L(I nd? D)?1 R In the above equation = si nd and A0 R L D = A 0 A 1 A d?1 A d I n I n I n 0 Proof of Lemma 1 See [8]. In relation to the above LFR, we dene the following matrices A Q = B R = A0 R L D () In order to avoid any redundancy in components of vectors p and q, we may require that matrices Q and R have full rank. If this is not the case, we can perform a series of reductions as described in the Appendix. Performing this reduction is not necessary, but usually signicantly reduces problem dimensions. Let r denote the dimension of diagonal matrix. We can dene vectors p; q C r that A(s)x = A 0 x + Lp q = Rx + Dp p = q such () Lemma Let B a Hermitian matrix and D C the corresponding region as dened in equation (1). Then there exist vectors p; q C r such that Q = [I k q I k p]b[i k q I k p]? = B 00 qq? + B 10 pq? + B 01 qp? + B 11 pp? 0 () if and only if p = sq and s D C. 9

10 Proof of Lemma The proof is adapted from Lemma C.1 in [11]. If r = 1, vectors p and q are scalars and the result readily follows. Now suppose that r > 1. Since (B) > 0, for arbitrary vectors p and q, generically it holds (Q) > 0. If we enforce Q to be positive semidenite, then the negative eigenvalues of Q vanish and the rank of Q drops beyond its normal value. Since B is non-singular, this rank deciency comes necessarily from vectors p; q. This may occur only if vectors p; q become linearly dependent, i.e. if there exists a scalar s such that p = sq. In this case, matrix Q = (B 00 + B 10 s + B 01 s? + B 11 ss? ) qq? is positive semidenite for any vector q. Therefore, scalar s belongs to region D C. Dene the rank-one positive semidenite matrix x x X = zz? = p p and the projection matrix In virtue of equations () and (), it holds P = [0 I r ] A(s)x = Az q = Qz p = Pz? 0 () Inequality () is therefore an LMI in matrix X. Let us denote it by a linear map F (X) = B 00 (QXQ? ) + B 10 (PXQ? ) + B 01 (QXP? ) + B 11 (PXP? ) (8) Using equations (), () and (8), an alternative formulation of problem () can now be derived. It reads = min TraceA? AX st F (X) 0 X 0 RankX = 1 Problem (9) is an LMI optimization problem with a rank constraint. It must be pointed out that rank-constrained LMIs frequently arise in control problems [1, 18, 19] but also in mathematical programming and combinatorial optimization. In [], it is shown that all of the problems with polynomial objective and polynomial constraints (including quadratic programming, binary programming, integer programming, to mention just a few) may actually be formulated as rank-constrained LMI optimization problems. (9). Quadratic Programming Rank-one LMI problem (9) can be transformed into a quadratic optimization problem with the help of the following result. 10

11 Lemma S = S? 0 if and only if TraceP S 0 for every matrix P = P? 0. Proof of Lemma Just put matrix S into Schur form, see Lemma C. in [11]. Let where P gh C rr. Similarly, let P = P? = B ef = where B ef gh C and dene the linear map F D (P ) = kx kx g=1 h=1 P 11. P k1 P 1k. P kk B ef 11 B ef 1k. B ef k1. B ef kk? B 00 hgq? P gh Q + B 10 hgp? P gh Q + B 01 hgq? P gh Q + B 11 hgp? P gh P (10) dual to the map introduced in (8). Letting M 0 = Q and M 1 = P, matrix inequality F (X) 0 holds if and only if the scalar TraceP F (X) = Trace = Trace = Trace 1X 1X e=0 f =0 1X 1X 1X 1X kx P 11. P k1 kx e=0 f =0 g=1 h=1 e=0 f =0 g=1 h=1 = TraceF D (P )X kx kx P 1k. P kk B11M ef e XM? f B ef B ef hg P ghm e XM? f B ef hgm? f P ghm e X. k1m e XM? f B1kM ef e XM? f B1kM ef e XM? f. is greater than or equal to zero for every positive denite matrix P = P? 0. Now dene quadratic forms f 0 (z) = z? A? Az f 1 (z) = z? F D (P )z With these notations, rank-one LMI problem (9) can equivalently be written as the quadratic optimization problem = min f 0 (z) s.t. f 1 (z) 0 (11) 11

12 . LMI Formulation Finally, we apply the S-procedure to quadratic problem (11) to show that the non-convex rank constraint in problem (9) can actually be dropped. Notice that > 0 in problem (9) if and only if f 0 (z) > 0 for all non-zero vector z such that f 1 (z) 0. Since P is positive denite, there always exists some non-zero vector z 0 such that f 1 (z 0 ) > 0. Therefore, we can use the S-procedure [] to prove that > 0 in problem (9) if and only if A? A F D (P ) P = P? 0 Dening N as a basis for the right null-space of matrix A, i.e. AN = 0; it follows from the Elimination Lemma [] that feasibility problem (1) can equivalently be written as N? F D (P )N 0 P = P? 0 Using standard semidenite programming duality arguments [], we show that feasibility problem (1) is dual to LMI optimization problem (9) without the rank constraint. To see this, build the Lagrangian L(P; X; Y ) =?Trace(A? A?F D (P ))X?TraceP Y =?TraceA? AX +Trace(F (X)?Y )P where X = X? 0 and Y = Y? 0 are Lagrange multiplier matrices. The dual function associated to the Lagrangian reads g(x; Y ) = min L(P; X; Y ) = P?TraceA? AX if F (X) = Y 0?1 otherwise. The dual optimization problem, obtained by maximizing dual function g(x; Y ) is therefore (1) (1) = min TraceA? AX s.t. F (X) 0 X = X? 0 (1) Since matrix P is positive denite, there is always a vector z such that f 1 (z) > 0 in problem (11). Therefore Slater's qualication constraint holds and in the absence of a duality gap the optimal value in problem (1) is equal to the optimal value in problem (11). We have shown the main result of this paper. Theorem 1 The zeros of polynomial matrix A(s) belong to region D if and only if > 0 in LMI optimization problem (1). Corollary 1 The zeros of polynomial matrix A(s) belong to region D if and only if there is a matrix P solution to LMI problem (1). 1

13 Both problems (1) and (1) are linear problems over the cone of positive denite matrices. They can be solved very eciently with the interior-point methods described in []. When an LMI features complex coecients, it can be transformed into a real LMI using the standard manipulations described in [9]. Remark 1 In Section.1 we have assumed that vector x is non-zero. Without loss of generality, we can thus enforce normalization equality x? x = 1 in optimization problem (). Equivalently we can enforce equality In 0 Trace X = in LMI optimization problem (1). Illustration In the following examples, we dene and solve the LMI problems with the user-friendly interface Lmitool.0 for Matlab 1 [1]. We used a tolerance of 0001 to enforce strict deniteness of the LMIs. The computations involving polynomial matrices are performed with the Polynomial Toolbox Version.0 for Matlab [1]..1 Lyapunov Theorem as a Particular Case As a rst illustration, we show that the well-known Lyapunov Theorem can be derived as a particular case of Corollary 1, as pointed out in []. Consider the polynomial matrix A(s) = A 0? si n Hurwitz stability of constant matrix A 0 is equivalent to polynomial matrix A(s) having its zeros in the closed left half-plane D = fx + jy C x < 0g Associated to region D is the indenite matrix 0 1 B = 1 0 An obvious choice for a right null-space basis for matrix A = A 0?I n is given by N = In 1 Matlab is a trademark of The MathWorks, Inc. A 0 1

14 Consequently, LMI problem (1) becomes N? F (P )N = [ I n A? 0 ] ([ 0 I n ]? P [ I n 0 ] + [ I n 0 ]? P [ 0 I n ]) [ I n A? 0 ]? 0 for any positive denite Hermitian matrix P. This can be written more compactly as the standard LMI stemming from the Lyapunov Theorem A? 0 P + P A 0 0 P = P? 0. Stability Bounds Consider as in [] the second degree polynomial matrix s + 1= as A(s) = as s + 1= arising from a closed-loop system with feedback gain a R. We study stability of A(s) with respect to the unit disk, i.e. D = fs C ss? < 1g Associated to region D is the indenite matrix?1 0 B = 0 1 The LFR matrices corresponding to A(s) are as follows A0 R L D = A Q = B R = 1= 0 0 a = a Then, we solve the LMI feasibility problem of Corollary 1 for dierent values of a. Letting a = 19 we obtain a strictly feasible positive denite solution P = When a 10 the solver dectects unfeasibility of the LMIs. Similarly, letting a =?19 we obtain a strictly feasible positive denite solution P = ?1 0 1?90 0 0? ?

15 When a?10 the solver detects unfeasibility of the LMIs. After a tedious application of the Schur-Cohn criterion to the determinant of A(s), it can be shown that A(s) has all its zeros inside the unit circle if and only if jaj 19, which is consistent with our experiments.. Zeros at Innity Consider the polynomial matrix a + s as + s A(s) = s 1 + s parametrized in a R. We study stability of A(s) with respect to the left half-plane, i.e. Associated to region D C D C = fs C s + s? 0g is the indenite matrix 0 1 B = 1 0 We readily compute det A(s) = s + a hence the polynomial matrix is stable if and only if a > 0. LFR matrices associated to A(s) are given by A0 R L D = A Q = B R = a 0 1 a Following the reduction procedure described in the Appendix, we successively remove column in R and row in Q cancel column in R with matrix V = 1 0? and remove column in R and row in Q to eventually come up with the reduced LFR A0 R L D = 1 a 0 1 a

16 LMI optimization problem (1) reads = min Trace s.t a 0 a a a a a 0 a a? X X = X? Recalling Remark 1, we add the constraint I 0 Trace 0 0 to the above LMI problem. X X = 1? X Let a = 1. The optimal solution to the above LMI problem is = 0 for X = x p x p? = 1 0 0? ?1? 0 0 One can check that vector q is equal to zero in equations (). Since q = p=s and vector p is non-zero, it follows that ss? tends to innity. We can thus conclude that polynomial matrix A(s) features a zero at innity. This zero belongs to the unstable region D C, yet A(s) is a stable matrix since its nite zero z =?1 does not belong to D C. That clearly illustrates the fact that we cannot conclude about stability of nite zeros of a polynomial matrix featuring innite zeros when working in open regions such as the left half-plane. As pointed out in Section., this problem can be overcome when considering half-disk D C r = s C s + s? 0; ss? r as a bounded complementary stability region, for a suciently large r R. Associated to region D C r is the indenite matrix B = r ?1 When a = 1, the optimal solution to LMI problem (1) is = 10? > 0 when r = 10 and = 10? > 0 when r = 100. This is consistent with the fact that A(s) has a nite stable zero in z =?1. When a =?1, the optimal solution to LMI problem (1) is = 1 10?11 0 when r = 10 and = 8 10?11 0 when r = 100. This is consistent with the fact that A(s) has a nite unstable zero in z = 1. 1

17 . Union of Regions Consider the model of a VTOL helicopter proposed in []. A state-feedback is designed as in [] to locate the closed-loop poles of the linearized system. The resulting system reads _x = Ax + Bu y = Cx where A = ?199?118?1? ?99? for an uncertain parameter a R and B = 0 011?9? a C = We investigate pole clustering of the above system in a non-connected region D which is the union of ellipse fx + jy C (x + ) =9 + y < 1g and half-plane fx + jy C x <?g As pointed out in Section., the ellipse corresponds to slow dynamics and the half-plane corresponds to fast dynamics. The indenite matrix corresponding to the union of the above regions is given by B = 8=9 0 0 = = = For a given value of parameter a, we build the right coprime matrix fraction description [, ] N(s)D?1 (s) = C(sI? A)?1 B of the transfer function from input u to output y. We enforce denominator polynomial matrix D(s) to be column-reduced []. As a result, D(s) has no innite zeros and it is not necessary to pursue the approach of Section.. Then we study stability of polynomial matrix D(s) by solving LMI optimization problem (1). By virtue of Remark 1, we add the constraint I 0 Trace X =

18 When a = 0, we get N(s) =? s s + 00s?0989? s and D(s) =?008? s s?8 + 1s + 98s? +?101s? s + 098s LMI optimization problem (1) yields X = 09?00? ?0? ?019?0 00? ?0? ?019? ?18 111?0? ?01? ?18?01 8 and = 00 > 0. Hence all the zeros of polynomial matrix D(s) are located in region D. When a =?1, we get N(s) =? s s s 00? 0s and D(s) =? s s? s + 098s?180? 0s? s s LMI optimization problem (1) yields X = 001?09? ?0009? ?0018? ? ?0009? ?0018? ? ?0009? ?00001? ?00001? and = 91 10?8 0. Therefore, some zeros of polynomial matrix D(s) are located outside of region D. We can verify these results by plotting the root locus of matrix A. As can be seen in Figure 1, all the eigenvalues belong to region D when a = 0, but not when a =?1. 18

19 y=imag(s) x=0 a=0 a= 1 D x=real(s) Figure 1. Root locus of matrix A when a = 0 and a =?1. Conclusion We have proposed a general LMI methodology for determining whether the zeros of a given polynomial matrix belong to a given region of the complex plane. Contrary to most of the existing D-stability methods, no determinant or zero computation is required. As another advantage, we can easily handle rectangular matrices or matrices with complex coecients. The class of regions covered by our approach is very large and most notably includes non-convex regions or non-connected unions thereof. Another strength of the method is its reliance upon semidenite programming, for which powerful and ecient algorithms are widely available. Our work hints at several directions for future research. The most promising one is probably the extension of our approach to uncertain polynomial matrices and robust stability analysis. Our D-stability conditions can naturally be combined with other LMIs representing norm-bounded or interval uncertainties. However, the resulting optimization problem may lose its nice convexity properties and heuristic or global optimization algorithms must be devised. In the same vein, we can also handle -D or more general n-d polynomial matrices. A point that deserves further attention is the numerical performance of our method compared to standard routines based on determinant computation and scalar stability tests. It is believed that the performance will strongly hinge upon the LMI solver in use and that some built-in parameter tunings will be required. Another interesting extension would be to consider synthesis problems and Diophantine equations over polynomial matrices []. Here also, the resulting optimization problem 19

20 becomes a non-convex bilinear matrix inequality problem. Acknowledgments We are grateful to Laurent El Ghaoui, ENSTA, Paris, for providing a preprint of the paper []. The rst author would like to thank Denis Arzelier and Dimitry Peaucelle, LAAS-CNRS, Toulouse, for fruitful discussions. Appendix Suppose we are a given a polynomial matrix A(s) and its LFR as in Lemma 1. following procedure reduces the LFR such that matrices Q and R have full rank. The Step 1. If Q is rank decient, let U be the lower-left triangular matrix with ones along the diagonal such that the linearly dependent rows in Q are forced to zero in matrix UQ. Let J be the set of indices of these rows. Replace matrices L,R and D by LU?1,UR and UDU?1, respectively. Suppress rows J in L,D, and suppress columns J in R,D,. Update matrices R and Q accordingly. Step. If R is rank decient, let V = U?1 be the upper-right triangular matrix with ones along the diagonal such that the linearly dependent columns in R are forced to zero in matrix RV. Let J be the set of indices of these columns. Replace matrices L,R and D by LV,V?1 R and V?1 DV, respectively. Suppress columns J in L,D, and suppress rows J in R,D,. Update matrices R and Q accordingly. Step. Go to Step 1 until no reduction can be achieved. The above procedure results in a reduced LFR of A(s) with full rank matrices Q and R. The proof follows by careful inspection. The key point is in noting that matrix commutes with matrix U = V?1, i.e. U = U. Therefore, is not aected by the successive similarity transformations. Redundant components in p and q corresponding to zero rows in Q or zero columns in R can therefore be removed without altering the LFR of A(s). Note that reduction matrices U and V can be computed using numerically stable operations [1]. References [1] J. Ackermann \Robust Control Systems with Uncertain Parameters", Springer Verlag, London, 199. [] S. M. Ahn \Stability of a Matrix Polynomial in Discrete Systems", IEEE Transactions on Automatic Control, Vol., No., pp. 11{11,

21 [] B. D. O. Anderson and R. R. Bitmead \Stability of Matrix Polynomials", International Journal of Control, Vol., No., pp. {, 19. [] O. Bachelier \Commande des Systemes Lineaires Incertains. Placement de P^oles Robustes en D-Stabilite", Ph. D. Thesis, LAAS-CNRS, Toulouse, France, [] B. R. Barmish \New Tools for Robustness of Linear Systems", Macmillan, New York, 199. [] A. Ben-Tal, L. El Ghaoui and A. Nemirovski \Robust Semidenite Programming", Research Report, Optimization Laboratory, Faculty of Industrial Engineering and Management, The Israel Institute of Technology, Technion City, Haifa, Israel, To appear in R. Saigal, L. Vandenberghe and H. Wolkowicz (Editors), \Handbook of Semidenite Programming", Kluwer Academic Publishers, Boston, Massachusetts, [] S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan \Linear Matrix Inequalities in System and Control Theory", SIAM Studies in Applied Mathematics, Philadelphia, Pennsylvania, 199. [8] L. Brugnano and D. Trigiante \Polynomial Roots the Ultimate Answer?", Linear Algebra and its Applications, Vol., pp. 0{19, 199. [9] M. Chilali \Methodes LMI pour l'analyse et la Synthese Multi-Criteres", Ph. D. Thesis, UFR Mathematiques de la Decision, Paris IX Dauphine, France, 199. [10] M. Chilali and P. Gahinet \H1 Design with Pole Placement Constraints An LMI Approach", IEEE Transactions on Automatic Control, Vol. 1, No., pp. 8{, 199. [11] L. El Ghaoui, \Robustness of Linear Systems to Parameter Variations", Ph. D. Thesis, Department of Aeronautics and Astronautics, Stanford University, California, [1] L. El Ghaoui and P. Gahinet \Rank Minimization under LMI Constraints A Framework for Output Feedback Problems", Proceedings of the European Control Conference, Groningen, The Netherlands, 199. [1] L. El Ghaoui, J. L. Commeau \Lmitool.0 Package An Interface to Solve LMI Problems", E-Letters on Systems, Control and Signal Processing, Issue 1, [1] G. H. Golub and C. F. Van Loan \Matrix Computations. Third Edition", The Johns Hopkins University Press, Baltimore, Maryland, 199. [1] S. Gutman \Root Clustering of a Complex Matrix in an Algebraic Region", IEEE Transactions on Automatic Control, Vol., No., pp. {0, 199. [1] S. Gutman and E. I. Jury \A General Theory for Matrix Root Clustering in Subregions of the Complex Plane", IEEE Transactions on Automatic Control, Vol., No., pp. 8{8, [1] D. Henrion and M. Sebek \Improved Polynomial Matrix Determinant Computation", Technical Report, LAAS-CNRS, Toulouse, France, Submitted for publication. 1

22 [18] D. Henrion, S. Tarbouriech and M. Sebek \Algebraic Approach to Robust Controller Design A Geometric Interpretation", Proceedings of the American Control Conference, AACC, pp. 0{0, Philadelphia, Pennsylvania, [19] D. Henrion, S. Tarbouriech and M. Sebek \Rank-one LMI Approach to Simultaneous Stabilization of Linear Systems", to appear in Proceedings of the European Control Conference, EUCA, Karlsruhe, Germany, [0] M. Hromck and M. Sebek \New Algorithms for Polynomial Matrices Based on FFT", Technical Report, Institute of Information Theory and Automation, Czech Academy of Sciences, Prague, Czech Republic, Submitted for publication. [1] E. I. Jury \Inners and Stability of Dynamic Systems", Wiley, New York, 19. [] T. Kailath \Linear Systems", Prentice Hall, Englewood Clis, New Jersey, [] V. Kucera \Discrete Linear Control The Polynomial Approach", John Wiley and Sons, Chichester, England, 199. [] H. Kwakernaak \State-space Algorithms for Polynomial Matrix Computations", Memorandum, No. 118, Department of Applied Mathematics, University of Twente, The Netherlands, 199. [] H. Kwakernaak and M. Sebek \Polynomial J-Spectral Factorization", IEEE Transactions on Automatic Control, Vol. 9, No., pp. 1{8, 199. [] Y. Nesterov and A. Nemirovski \Interior-Point Polynomial Methods in Convex Programming", SIAM Studies in Applied Mathematics, Vol. 1, Philadelphia, Pennsylvania, 199. [] K. T. Ngo and K. T. Erickson \Stability of Discrete-Time Matrix Polynomials", IEEE Transactions on Automatic Control, Vol., No., pp. 8{, 199. [8] V. Y. Pan \Solving a Polynomial Equation Some History and Recent Progress", SIAM Review, Vol. 9, No., pp. 18{0, 199. [9] F. Kraus, M. Mansour and M. Sebek \Hurwitz Matrix for Polynomial Matrices", in R. Jeltsch and M. Mansour (Editors) \Stability Theory. Proceedings of the Conference - Centennial Hurwitz on Stability Theory", International Series of Numerical Mathematics, Vol. 11, pp. {, Birkhauser Verlag, Basel, Switzerland, 199. [0] M. Sebek, S. Pejchova, D. Henrion and H. Kwakernaak \Numerical Methods for Zeros and Determinant of Polynomial Matrix", Proceedings of the Mediterranean Symposium on New Directions in Control and Automation, IEEE, pp , Chania, Crete, Greece, 199. [1] M. Sebek, H. Kwakernaak, D. Henrion and S. Pejchova \Recent Progress in Polynomial Methods and Polynomial Toolbox for Matlab Version.0", Proceedings of the Conference on Decision and Control, IEEE, pp. 1-8, Tampa, Florida, December See also the Polynomial Toolbox home page at

23 [] V. L. Syrmos and F. L. Lewis \Output Feedback Eigenstructure Assignment Using Two Sylvester Equations", IEEE Transactions on Automatic Control, Vol. 8, No., pp. 9{99, 199. [] L. Vandenberghe and S. Boyd, \Semidenite Programming", SIAM Review, Vol. 8, pp. 9{9, 199. [] A. I. G. Vardulakis, \Linear Multivariable Control. Algebraic Analysis and Synthesis Methods", Wiley, Chichester, [] J. C. Willems \Paradigms and Puzzles in the Theory of Dynamical Systems", IEEE Transactions on Automatic Control, Vol., pp. 9{9, [] V. A. Yakubovich \The S-procedure in Nonlinear Control Theory", Vestnik Leningrad University of Mathematics, Vol., pp. {9, 19. In Russian, 191. [] R. K. Yedavalli \Robust Root Clustering for Linear Uncertain Systems Using Generalized Lyapunov Theory", Automatica, Vol. 9, No. 1, pp. {0, 199. [8] K. Zhou, J. C. Doyle and K. Glover \Robust and Optimal Control", Prentice Hall, Upper Saddle River, New Jersey, 199.

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about

Rank-one LMIs and Lyapunov's Inequality. Gjerrit Meinsma 4. Abstract. We describe a new proof of the well-known Lyapunov's matrix inequality about Rank-one LMIs and Lyapunov's Inequality Didier Henrion 1;; Gjerrit Meinsma Abstract We describe a new proof of the well-known Lyapunov's matrix inequality about the location of the eigenvalues of a matrix

More information

Links Between Robust and Quadratic Stability of. Michael Sebek 4;5. Vladimr Kucera 4;5. Abstract

Links Between Robust and Quadratic Stability of. Michael Sebek 4;5. Vladimr Kucera 4;5. Abstract Links Between Robust and Quadratic Stability of Uncertain Discrete-Time Polynomials 1 Didier Henrion 2;3 Michael Sebek 4;5 Vladimr Kucera 4;5 bstract n uncertain polynomial is robustly stable, or stable

More information

Fixed-Order Robust H Controller Design with Regional Pole Assignment

Fixed-Order Robust H Controller Design with Regional Pole Assignment SUBMITTED 1 Fixed-Order Robust H Controller Design with Regional Pole Assignment Fuwen Yang, Mahbub Gani, and Didier Henrion Abstract In this paper, the problem of designing fixed-order robust H controllers

More information

Optimization based robust control

Optimization based robust control Optimization based robust control Didier Henrion 1,2 Draft of March 27, 2014 Prepared for possible inclusion into The Encyclopedia of Systems and Control edited by John Baillieul and Tariq Samad and published

More information

On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 1: block Toeplitz algorithms.

On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 1: block Toeplitz algorithms. On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 1: block Toeplitz algorithms. J.C. Zúñiga and D. Henrion Abstract Four different algorithms are designed

More information

Linear Systems with Saturating Controls: An LMI Approach. subject to control saturation. No assumption is made concerning open-loop stability and no

Linear Systems with Saturating Controls: An LMI Approach. subject to control saturation. No assumption is made concerning open-loop stability and no Output Feedback Robust Stabilization of Uncertain Linear Systems with Saturating Controls: An LMI Approach Didier Henrion 1 Sophie Tarbouriech 1; Germain Garcia 1; Abstract : The problem of robust controller

More information

Control of linear systems subject to time-domain constraints with polynomial pole placement and LMIs

Control of linear systems subject to time-domain constraints with polynomial pole placement and LMIs Control of linear systems subject to time-domain constraints with polynomial pole placement and LMIs Didier Henrion 1,2,3,4 Sophie Tarbouriech 1 Vladimír Kučera 3,5 February 12, 2004 Abstract: The paper

More information

Didier HENRION henrion

Didier HENRION   henrion POLYNOMIAL METHODS FOR ROBUST CONTROL Didier HENRION www.laas.fr/ henrion henrion@laas.fr Laboratoire d Analyse et d Architecture des Systèmes Centre National de la Recherche Scientifique Université de

More information

Optimizing simultaneously over the numerator and denominator polynomials in the Youla-Kučera parametrization

Optimizing simultaneously over the numerator and denominator polynomials in the Youla-Kučera parametrization Optimizing simultaneously over the numerator and denominator polynomials in the Youla-Kučera parametrization Didier Henrion Vladimír Kučera Arturo Molina-Cristóbal Abstract Traditionally when approaching

More information

On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 2: block displacement structure algorithms.

On the application of different numerical methods to obtain null-spaces of polynomial matrices. Part 2: block displacement structure algorithms. On the application of different numerical methods to obtain null-spaces of polynomial matrices Part 2: block displacement structure algorithms JC Zúñiga and D Henrion Abstract Motivated by some control

More information

The model reduction algorithm proposed is based on an iterative two-step LMI scheme. The convergence of the algorithm is not analyzed but examples sho

The model reduction algorithm proposed is based on an iterative two-step LMI scheme. The convergence of the algorithm is not analyzed but examples sho Model Reduction from an H 1 /LMI perspective A. Helmersson Department of Electrical Engineering Linkoping University S-581 8 Linkoping, Sweden tel: +6 1 816 fax: +6 1 86 email: andersh@isy.liu.se September

More information

Maximizing the Closed Loop Asymptotic Decay Rate for the Two-Mass-Spring Control Problem

Maximizing the Closed Loop Asymptotic Decay Rate for the Two-Mass-Spring Control Problem Maximizing the Closed Loop Asymptotic Decay Rate for the Two-Mass-Spring Control Problem Didier Henrion 1,2 Michael L. Overton 3 May 12, 2006 Abstract We consider the following problem: find a fixed-order

More information

Strong duality in Lasserre s hierarchy for polynomial optimization

Strong duality in Lasserre s hierarchy for polynomial optimization Strong duality in Lasserre s hierarchy for polynomial optimization arxiv:1405.7334v1 [math.oc] 28 May 2014 Cédric Josz 1,2, Didier Henrion 3,4,5 Draft of January 24, 2018 Abstract A polynomial optimization

More information

Research Article Partial Pole Placement in LMI Region

Research Article Partial Pole Placement in LMI Region Control Science and Engineering Article ID 84128 5 pages http://dxdoiorg/11155/214/84128 Research Article Partial Pole Placement in LMI Region Liuli Ou 1 Shaobo Han 2 Yongji Wang 1 Shuai Dong 1 and Lei

More information

Fixed Order H Controller for Quarter Car Active Suspension System

Fixed Order H Controller for Quarter Car Active Suspension System Fixed Order H Controller for Quarter Car Active Suspension System B. Erol, A. Delibaşı Abstract This paper presents an LMI based fixed-order controller design for quarter car active suspension system in

More information

ROBUST ANALYSIS WITH LINEAR MATRIX INEQUALITIES AND POLYNOMIAL MATRICES. Didier HENRION henrion

ROBUST ANALYSIS WITH LINEAR MATRIX INEQUALITIES AND POLYNOMIAL MATRICES. Didier HENRION  henrion GRADUATE COURSE ON POLYNOMIAL METHODS FOR ROBUST CONTROL PART IV.1 ROBUST ANALYSIS WITH LINEAR MATRIX INEQUALITIES AND POLYNOMIAL MATRICES Didier HENRION www.laas.fr/ henrion henrion@laas.fr Airbus assembly

More information

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009

LMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009 LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix

More information

LMI optimization for fixed-order H controller design

LMI optimization for fixed-order H controller design LMI optimization for fixed-order H controller design Didier Henrion 1,2,3 February 13, 2003 Abstract A general H controller design technique is proposed for scalar linear systems, based on properties of

More information

Solving polynomial static output feedback problems with PENBMI

Solving polynomial static output feedback problems with PENBMI Solving polynomial static output feedback problems with PENBMI Didier Henrion, Johan Löfberg, Michal Kočvara, Michael Stingl Abstract An algebraic formulation is proposed for the static output feedback

More information

On parameter-dependent Lyapunov functions for robust stability of linear systems

On parameter-dependent Lyapunov functions for robust stability of linear systems On parameter-dependent Lyapunov functions for robust stability of linear systems Didier Henrion, Denis Arzelier, Dimitri Peaucelle, Jean-Bernard Lasserre Abstract For a linear system affected by real parametric

More information

PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT

PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT Hans Norlander Systems and Control, Department of Information Technology Uppsala University P O Box 337 SE 75105 UPPSALA, Sweden HansNorlander@ituuse

More information

arzelier

arzelier COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.1 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS STABILITY ANALYSIS Didier HENRION www.laas.fr/ henrion henrion@laas.fr Denis ARZELIER www.laas.fr/

More information

A new robust delay-dependent stability criterion for a class of uncertain systems with delay

A new robust delay-dependent stability criterion for a class of uncertain systems with delay A new robust delay-dependent stability criterion for a class of uncertain systems with delay Fei Hao Long Wang and Tianguang Chu Abstract A new robust delay-dependent stability criterion for a class of

More information

Positive Polynomials and Robust Stabilization with Fixed-Order Controllers

Positive Polynomials and Robust Stabilization with Fixed-Order Controllers Positive Polynomials and Robust Stabilization with Fixed-Order Controllers Didier Henrion 1,2, Michael Šebek3, Vladimír Kučera 3 November 26, 2002 Abstract Recent results on positive polynomials are used

More information

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach Bhaskar Ramasubramanian, Swanand R Khare and Madhu N Belur Abstract This paper formulates the problem

More information

Proc. 9th IFAC/IFORS/IMACS/IFIP/ Symposium on Large Scale Systems: Theory and Applications (LSS 2001), 2001, pp

Proc. 9th IFAC/IFORS/IMACS/IFIP/ Symposium on Large Scale Systems: Theory and Applications (LSS 2001), 2001, pp INVARIANT POLYHEDRA AND CONTROL OF LARGE SCALE SYSTEMS Jean-Claude Hennet LAAS - CNRS 7, Avenue du Colonel Roche, 31077 Toulouse Cedex 4, FRANCE PHONE: (+33) 5 61 33 63 13, FAX: (+33) 5 61 33 69 36, e-mail:

More information

On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays

On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays Article On Computing the Worst-case Performance of Lur'e Systems with Uncertain Time-invariant Delays Thapana Nampradit and David Banjerdpongchai* Department of Electrical Engineering, Faculty of Engineering,

More information

Stability of linear time-varying systems through quadratically parameter-dependent Lyapunov functions

Stability of linear time-varying systems through quadratically parameter-dependent Lyapunov functions Stability of linear time-varying systems through quadratically parameter-dependent Lyapunov functions Vinícius F. Montagner Department of Telematics Pedro L. D. Peres School of Electrical and Computer

More information

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion

COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION   henrion COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F

More information

CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren

CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CESAME, Université catholique de Louvain Bâtiment Euler, Avenue G. Lemaître 4-6 B-1348 Louvain-la-Neuve,

More information

June Engineering Department, Stanford University. System Analysis and Synthesis. Linear Matrix Inequalities. Stephen Boyd (E.

June Engineering Department, Stanford University. System Analysis and Synthesis. Linear Matrix Inequalities. Stephen Boyd (E. Stephen Boyd (E. Feron :::) System Analysis and Synthesis Control Linear Matrix Inequalities via Engineering Department, Stanford University Electrical June 1993 ACC, 1 linear matrix inequalities (LMIs)

More information

Robust linear optimization under general norms

Robust linear optimization under general norms Operations Research Letters 3 (004) 50 56 Operations Research Letters www.elsevier.com/locate/dsw Robust linear optimization under general norms Dimitris Bertsimas a; ;, Dessislava Pachamanova b, Melvyn

More information

Static Output Feedback Stabilisation with H Performance for a Class of Plants

Static Output Feedback Stabilisation with H Performance for a Class of Plants Static Output Feedback Stabilisation with H Performance for a Class of Plants E. Prempain and I. Postlethwaite Control and Instrumentation Research, Department of Engineering, University of Leicester,

More information

Lecture Note 5: Semidefinite Programming for Stability Analysis

Lecture Note 5: Semidefinite Programming for Stability Analysis ECE7850: Hybrid Systems:Theory and Applications Lecture Note 5: Semidefinite Programming for Stability Analysis Wei Zhang Assistant Professor Department of Electrical and Computer Engineering Ohio State

More information

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite

More information

II.3. POLYNOMIAL ANALYSIS. Didier HENRION

II.3. POLYNOMIAL ANALYSIS. Didier HENRION II.3. POLYNOMIAL ANALYSIS Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Polynomial methods Based on the algebra of polynomials and polynomial matrices, typically

More information

2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable

2 EBERHARD BECKER ET AL. has a real root. Thus our problem can be reduced to the problem of deciding whether or not a polynomial in one more variable Deciding positivity of real polynomials Eberhard Becker, Victoria Powers, and Thorsten Wormann Abstract. We describe an algorithm for deciding whether or not a real polynomial is positive semidenite. The

More information

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space

Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................

More information

Convex Optimization Approach to Dynamic Output Feedback Control for Delay Differential Systems of Neutral Type 1,2

Convex Optimization Approach to Dynamic Output Feedback Control for Delay Differential Systems of Neutral Type 1,2 journal of optimization theory and applications: Vol. 127 No. 2 pp. 411 423 November 2005 ( 2005) DOI: 10.1007/s10957-005-6552-7 Convex Optimization Approach to Dynamic Output Feedback Control for Delay

More information

1 Introduction Semidenite programming (SDP) has been an active research area following the seminal work of Nesterov and Nemirovski [9] see also Alizad

1 Introduction Semidenite programming (SDP) has been an active research area following the seminal work of Nesterov and Nemirovski [9] see also Alizad Quadratic Maximization and Semidenite Relaxation Shuzhong Zhang Econometric Institute Erasmus University P.O. Box 1738 3000 DR Rotterdam The Netherlands email: zhang@few.eur.nl fax: +31-10-408916 August,

More information

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010

I.3. LMI DUALITY. Didier HENRION EECI Graduate School on Control Supélec - Spring 2010 I.3. LMI DUALITY Didier HENRION henrion@laas.fr EECI Graduate School on Control Supélec - Spring 2010 Primal and dual For primal problem p = inf x g 0 (x) s.t. g i (x) 0 define Lagrangian L(x, z) = g 0

More information

Multi-Model Adaptive Regulation for a Family of Systems Containing Different Zero Structures

Multi-Model Adaptive Regulation for a Family of Systems Containing Different Zero Structures Preprints of the 19th World Congress The International Federation of Automatic Control Multi-Model Adaptive Regulation for a Family of Systems Containing Different Zero Structures Eric Peterson Harry G.

More information

Marcus Pantoja da Silva 1 and Celso Pascoli Bottura 2. Abstract: Nonlinear systems with time-varying uncertainties

Marcus Pantoja da Silva 1 and Celso Pascoli Bottura 2. Abstract: Nonlinear systems with time-varying uncertainties A NEW PROPOSAL FOR H NORM CHARACTERIZATION AND THE OPTIMAL H CONTROL OF NONLINEAR SSTEMS WITH TIME-VARING UNCERTAINTIES WITH KNOWN NORM BOUND AND EXOGENOUS DISTURBANCES Marcus Pantoja da Silva 1 and Celso

More information

Applications of Controlled Invariance to the l 1 Optimal Control Problem

Applications of Controlled Invariance to the l 1 Optimal Control Problem Applications of Controlled Invariance to the l 1 Optimal Control Problem Carlos E.T. Dórea and Jean-Claude Hennet LAAS-CNRS 7, Ave. du Colonel Roche, 31077 Toulouse Cédex 4, FRANCE Phone : (+33) 61 33

More information

Optimization in. Stephen Boyd. 3rd SIAM Conf. Control & Applications. and Control Theory. System. Convex

Optimization in. Stephen Boyd. 3rd SIAM Conf. Control & Applications. and Control Theory. System. Convex Optimization in Convex and Control Theory System Stephen Boyd Engineering Department Electrical University Stanford 3rd SIAM Conf. Control & Applications 1 Basic idea Many problems arising in system and

More information

d A 0 + m t k A k 0 whenever λ min (B k (x)) t k λ max (B k (x)) for k = 1, 2,..., m x n B n (k).

d A 0 + m t k A k 0 whenever λ min (B k (x)) t k λ max (B k (x)) for k = 1, 2,..., m x n B n (k). MATRIX CUBES PARAMETERIZED BY EIGENVALUES JIAWANG NIE AND BERND STURMFELS Abstract. An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix

More information

Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design

Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design 324 IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL. 9, NO. 2, APRIL 2001 Parameterized Linear Matrix Inequality Techniques in Fuzzy Control System Design H. D. Tuan, P. Apkarian, T. Narikiyo, and Y. Yamamoto

More information

Robust Anti-Windup Compensation for PID Controllers

Robust Anti-Windup Compensation for PID Controllers Robust Anti-Windup Compensation for PID Controllers ADDISON RIOS-BOLIVAR Universidad de Los Andes Av. Tulio Febres, Mérida 511 VENEZUELA FRANCKLIN RIVAS-ECHEVERRIA Universidad de Los Andes Av. Tulio Febres,

More information

A note on continuous behavior homomorphisms

A note on continuous behavior homomorphisms Available online at www.sciencedirect.com Systems & Control Letters 49 (2003) 359 363 www.elsevier.com/locate/sysconle A note on continuous behavior homomorphisms P.A. Fuhrmann 1 Department of Mathematics,

More information

Didier HENRION henrion

Didier HENRION   henrion POLYNOMIAL METHODS FOR ROBUST CONTROL PART I.1 ROBUST STABILITY ANALYSIS: SINGLE PARAMETER UNCERTAINTY Didier HENRION www.laas.fr/ henrion henrion@laas.fr Pont Neuf over river Garonne in Toulouse June

More information

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr

only nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands

More information

ROBUST CONSTRAINED REGULATORS FOR UNCERTAIN LINEAR SYSTEMS

ROBUST CONSTRAINED REGULATORS FOR UNCERTAIN LINEAR SYSTEMS ROBUST CONSTRAINED REGULATORS FOR UNCERTAIN LINEAR SYSTEMS Jean-Claude HENNET Eugênio B. CASTELAN Abstract The purpose of this paper is to combine several control requirements in the same regulator design

More information

Lecture 6: Conic Optimization September 8

Lecture 6: Conic Optimization September 8 IE 598: Big Data Optimization Fall 2016 Lecture 6: Conic Optimization September 8 Lecturer: Niao He Scriber: Juan Xu Overview In this lecture, we finish up our previous discussion on optimality conditions

More information

SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic

SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic Didier Henrion Simone Naldi Mohab Safey El Din Version 1.0 of November 5, 2016 Abstract This document briefly describes

More information

Outline Introduction: Problem Description Diculties Algebraic Structure: Algebraic Varieties Rank Decient Toeplitz Matrices Constructing Lower Rank St

Outline Introduction: Problem Description Diculties Algebraic Structure: Algebraic Varieties Rank Decient Toeplitz Matrices Constructing Lower Rank St Structured Lower Rank Approximation by Moody T. Chu (NCSU) joint with Robert E. Funderlic (NCSU) and Robert J. Plemmons (Wake Forest) March 5, 1998 Outline Introduction: Problem Description Diculties Algebraic

More information

ON THE ROBUST STABILITY OF NEUTRAL SYSTEMS WITH TIME-VARYING DELAYS

ON THE ROBUST STABILITY OF NEUTRAL SYSTEMS WITH TIME-VARYING DELAYS ON THE ROBUST STABILITY OF NEUTRAL SYSTEMS WITH TIME-VARYING DELAYS V. J. S. Leite P. L. D. Peres E. B. Castelan S. Tarbouriech UnED Divinópolis CEFET-MG R. Monte Santo, 319 35502-036, Divinópolis - MG

More information

1 Outline Part I: Linear Programming (LP) Interior-Point Approach 1. Simplex Approach Comparison Part II: Semidenite Programming (SDP) Concludin

1 Outline Part I: Linear Programming (LP) Interior-Point Approach 1. Simplex Approach Comparison Part II: Semidenite Programming (SDP) Concludin Sensitivity Analysis in LP and SDP Using Interior-Point Methods E. Alper Yldrm School of Operations Research and Industrial Engineering Cornell University Ithaca, NY joint with Michael J. Todd INFORMS

More information

A Survey Of State-Feedback Simultaneous Stabilization Techniques

A Survey Of State-Feedback Simultaneous Stabilization Techniques University of New Mexico UNM Digital Repository Electrical & Computer Engineering Faculty Publications Engineering Publications 4-13-2012 A Survey Of State-Feedback Simultaneous Stabilization Techniques

More information

STABILITY AND STABILIZATION OF A CLASS OF NONLINEAR SYSTEMS WITH SATURATING ACTUATORS. Eugênio B. Castelan,1 Sophie Tarbouriech Isabelle Queinnec

STABILITY AND STABILIZATION OF A CLASS OF NONLINEAR SYSTEMS WITH SATURATING ACTUATORS. Eugênio B. Castelan,1 Sophie Tarbouriech Isabelle Queinnec STABILITY AND STABILIZATION OF A CLASS OF NONLINEAR SYSTEMS WITH SATURATING ACTUATORS Eugênio B. Castelan,1 Sophie Tarbouriech Isabelle Queinnec DAS-CTC-UFSC P.O. Box 476, 88040-900 Florianópolis, SC,

More information

Introduction to linear matrix inequalities Wojciech Paszke

Introduction to linear matrix inequalities Wojciech Paszke Introduction to linear matrix inequalities Wojciech Paszke Institute of Control and Computation Engineering, University of Zielona Góra, Poland e-mail: W.Paszke@issi.uz.zgora.pl Outline Introduction to

More information

H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions

H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions IEEE TRANSACTIONS ON FUZZY SYSTEMS, VOL 11, NO 2, APRIL 2003 271 H State-Feedback Controller Design for Discrete-Time Fuzzy Systems Using Fuzzy Weighting-Dependent Lyapunov Functions Doo Jin Choi and PooGyeon

More information

Linear Matrix Inequalities in Control

Linear Matrix Inequalities in Control Linear Matrix Inequalities in Control Delft Center for Systems and Control (DCSC) Delft University of Technology The Netherlands Department of Electrical Engineering Eindhoven University of Technology

More information

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3

MIT Algebraic techniques and semidefinite optimization February 14, Lecture 3 MI 6.97 Algebraic techniques and semidefinite optimization February 4, 6 Lecture 3 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture, we will discuss one of the most important applications

More information

IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS

IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS IMPROVED MPC DESIGN BASED ON SATURATING CONTROL LAWS D. Limon, J.M. Gomes da Silva Jr., T. Alamo and E.F. Camacho Dpto. de Ingenieria de Sistemas y Automática. Universidad de Sevilla Camino de los Descubrimientos

More information

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS

MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS MATH 425-Spring 2010 HOMEWORK ASSIGNMENTS Instructor: Shmuel Friedland Department of Mathematics, Statistics and Computer Science email: friedlan@uic.edu Last update April 18, 2010 1 HOMEWORK ASSIGNMENT

More information

Linear Matrix Inequality (LMI)

Linear Matrix Inequality (LMI) Linear Matrix Inequality (LMI) A linear matrix inequality is an expression of the form where F (x) F 0 + x 1 F 1 + + x m F m > 0 (1) x = (x 1,, x m ) R m, F 0,, F m are real symmetric matrices, and the

More information

where m r, m c and m C are the number of repeated real scalar blocks, repeated complex scalar blocks and full complex blocks, respectively. A. (D; G)-

where m r, m c and m C are the number of repeated real scalar blocks, repeated complex scalar blocks and full complex blocks, respectively. A. (D; G)- 1 Some properties of an upper bound for Gjerrit Meinsma, Yash Shrivastava and Minyue Fu Abstract A convex upper bound of the mixed structured singular value is analyzed. The upper bound is based on a multiplier

More information

Global Optimization of H problems: Application to robust control synthesis under structural constraints

Global Optimization of H problems: Application to robust control synthesis under structural constraints Global Optimization of H problems: Application to robust control synthesis under structural constraints Dominique Monnet 1, Jordan Ninin 1, and Benoit Clement 1 ENSTA-Bretagne, LabSTIC, IHSEV team, 2 rue

More information

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces

Contents. 2.1 Vectors in R n. Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v. 2.50) 2 Vector Spaces Linear Algebra (part 2) : Vector Spaces (by Evan Dummit, 2017, v 250) Contents 2 Vector Spaces 1 21 Vectors in R n 1 22 The Formal Denition of a Vector Space 4 23 Subspaces 6 24 Linear Combinations and

More information

The Simplest Semidefinite Programs are Trivial

The Simplest Semidefinite Programs are Trivial The Simplest Semidefinite Programs are Trivial Robert J. Vanderbei Bing Yang Program in Statistics & Operations Research Princeton University Princeton, NJ 08544 January 10, 1994 Technical Report SOR-93-12

More information

Multiobjective Optimization Applied to Robust H 2 /H State-feedback Control Synthesis

Multiobjective Optimization Applied to Robust H 2 /H State-feedback Control Synthesis Multiobjective Optimization Applied to Robust H 2 /H State-feedback Control Synthesis Eduardo N. Gonçalves, Reinaldo M. Palhares, and Ricardo H. C. Takahashi Abstract This paper presents an algorithm for

More information

To appear in IEEE Trans. on Automatic Control Revised 12/31/97. Output Feedback

To appear in IEEE Trans. on Automatic Control Revised 12/31/97. Output Feedback o appear in IEEE rans. on Automatic Control Revised 12/31/97 he Design of Strictly Positive Real Systems Using Constant Output Feedback C.-H. Huang P.A. Ioannou y J. Maroulas z M.G. Safonov x Abstract

More information

Research Article An Equivalent LMI Representation of Bounded Real Lemma for Continuous-Time Systems

Research Article An Equivalent LMI Representation of Bounded Real Lemma for Continuous-Time Systems Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 28, Article ID 67295, 8 pages doi:1.1155/28/67295 Research Article An Equivalent LMI Representation of Bounded Real Lemma

More information

Interval solutions for interval algebraic equations

Interval solutions for interval algebraic equations Mathematics and Computers in Simulation 66 (2004) 207 217 Interval solutions for interval algebraic equations B.T. Polyak, S.A. Nazin Institute of Control Sciences, Russian Academy of Sciences, 65 Profsoyuznaya

More information

SYNTHESIS OF LOW ORDER MULTI-OBJECTIVE CONTROLLERS FOR A VSC HVDC TERMINAL USING LMIs

SYNTHESIS OF LOW ORDER MULTI-OBJECTIVE CONTROLLERS FOR A VSC HVDC TERMINAL USING LMIs SYNTHESIS OF LOW ORDER MULTI-OBJECTIVE CONTROLLERS FOR A VSC HVDC TERMINAL USING LMIs Martyn Durrant, Herbert Werner, Keith Abbott Control Institute, TUHH, Hamburg Germany; m.durrant@tu-harburg.de; Fax:

More information

The moment-lp and moment-sos approaches

The moment-lp and moment-sos approaches The moment-lp and moment-sos approaches LAAS-CNRS and Institute of Mathematics, Toulouse, France CIRM, November 2013 Semidefinite Programming Why polynomial optimization? LP- and SDP- CERTIFICATES of POSITIVITY

More information

E5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming

E5295/5B5749 Convex optimization with engineering applications. Lecture 5. Convex programming and semidefinite programming E5295/5B5749 Convex optimization with engineering applications Lecture 5 Convex programming and semidefinite programming A. Forsgren, KTH 1 Lecture 5 Convex optimization 2006/2007 Convex quadratic program

More information

Graphical User Interface for Design Stabilizing Controllers

Graphical User Interface for Design Stabilizing Controllers Graphical User Interface for Design Stabilizing Controllers Petr Urban 1,2, Michael Šebek1 1 Department of Control Engineering, Faculty of Electrical Engineering, Czech Technical University, Prague 2 Institute

More information

LMI based output-feedback controllers: γ-optimal versus linear quadratic.

LMI based output-feedback controllers: γ-optimal versus linear quadratic. Proceedings of the 17th World Congress he International Federation of Automatic Control Seoul Korea July 6-11 28 LMI based output-feedback controllers: γ-optimal versus linear quadratic. Dmitry V. Balandin

More information

FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez

FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES. Danlei Chu, Tongwen Chen, Horacio J. Marquez FINITE HORIZON ROBUST MODEL PREDICTIVE CONTROL USING LINEAR MATRIX INEQUALITIES Danlei Chu Tongwen Chen Horacio J Marquez Department of Electrical and Computer Engineering University of Alberta Edmonton

More information

Robust Farkas Lemma for Uncertain Linear Systems with Applications

Robust Farkas Lemma for Uncertain Linear Systems with Applications Robust Farkas Lemma for Uncertain Linear Systems with Applications V. Jeyakumar and G. Li Revised Version: July 8, 2010 Abstract We present a robust Farkas lemma, which provides a new generalization of

More information

Robust Least Squares and Applications Laurent El Ghaoui and Herve Lebret Ecole Nationale Superieure de Techniques Avancees 3, Bd. Victor, 7739 Paris, France (elghaoui, lebret)@ensta.fr Abstract We consider

More information

From Convex Optimization to Linear Matrix Inequalities

From Convex Optimization to Linear Matrix Inequalities Dep. of Information Engineering University of Pisa (Italy) From Convex Optimization to Linear Matrix Inequalities eng. Sergio Grammatico grammatico.sergio@gmail.com Class of Identification of Uncertain

More information

QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those

QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE. Denitizable operators in Krein spaces have spectral properties similar to those QUASI-UNIFORMLY POSITIVE OPERATORS IN KREIN SPACE BRANKO CURGUS and BRANKO NAJMAN Denitizable operators in Krein spaces have spectral properties similar to those of selfadjoint operators in Hilbert spaces.

More information

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets

Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets Milan Korda 1, Didier Henrion,3,4 Draft of December 1, 016 Abstract Moment-sum-of-squares hierarchies

More information

Polynomial Stabilization with Bounds on the Controller Coefficients

Polynomial Stabilization with Bounds on the Controller Coefficients Proceedings of the 8th IFAC Symposium on Robust Control Design, Bratislava, Slovak Republic, July 8-, 25 Polynomial Stabilization with Bounds on the Controller Coefficients Julia Eaton Sara Grundel Mert

More information

u - P (s) y (s) Figure 1: Standard framework for robustness analysis function matrix and let (s) be a structured perturbation constrained to lie in th

u - P (s) y (s) Figure 1: Standard framework for robustness analysis function matrix and let (s) be a structured perturbation constrained to lie in th A fast algorithm for the computation of an upper bound on the -norm Craig T. Lawrence, y Andre L. Tits y Department of Electrical Engineering and Institute for Systems Research, University of Maryland,

More information

H controller design on the COMPLIB problems with the Robust Control Toolbox for Matlab

H controller design on the COMPLIB problems with the Robust Control Toolbox for Matlab H controller design on the COMPLIB problems with the Robust Control Toolbox for Matlab Didier Henrion 1,2 Draft of August 30, 2005 1 Introduction The COMPLIB library is a freely available Matlab package

More information

Chapter Robust Performance and Introduction to the Structured Singular Value Function Introduction As discussed in Lecture 0, a process is better desc

Chapter Robust Performance and Introduction to the Structured Singular Value Function Introduction As discussed in Lecture 0, a process is better desc Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology c Chapter Robust

More information

WE CONSIDER linear systems subject to input saturation

WE CONSIDER linear systems subject to input saturation 440 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 48, NO 3, MARCH 2003 Composite Quadratic Lyapunov Functions for Constrained Control Systems Tingshu Hu, Senior Member, IEEE, Zongli Lin, Senior Member, IEEE

More information

1 Introduction CONVEXIFYING THE SET OF MATRICES OF BOUNDED RANK. APPLICATIONS TO THE QUASICONVEXIFICATION AND CONVEXIFICATION OF THE RANK FUNCTION

1 Introduction CONVEXIFYING THE SET OF MATRICES OF BOUNDED RANK. APPLICATIONS TO THE QUASICONVEXIFICATION AND CONVEXIFICATION OF THE RANK FUNCTION CONVEXIFYING THE SET OF MATRICES OF BOUNDED RANK. APPLICATIONS TO THE QUASICONVEXIFICATION AND CONVEXIFICATION OF THE RANK FUNCTION Jean-Baptiste Hiriart-Urruty and Hai Yen Le Institut de mathématiques

More information

Semidefinite Programming Basics and Applications

Semidefinite Programming Basics and Applications Semidefinite Programming Basics and Applications Ray Pörn, principal lecturer Åbo Akademi University Novia University of Applied Sciences Content What is semidefinite programming (SDP)? How to represent

More information

An LQ R weight selection approach to the discrete generalized H 2 control problem

An LQ R weight selection approach to the discrete generalized H 2 control problem INT. J. CONTROL, 1998, VOL. 71, NO. 1, 93± 11 An LQ R weight selection approach to the discrete generalized H 2 control problem D. A. WILSON², M. A. NEKOUI² and G. D. HALIKIAS² It is known that a generalized

More information

Stability analysis and state feedback control design of discrete-time systems with a backlash

Stability analysis and state feedback control design of discrete-time systems with a backlash American Control Conference Marriott Waterfront, Baltimore, MD, USA June 3-July, ThA9.5 Stability analysis and state feedback control design of discrete-time systems with a backlash Christophe Prieur,

More information

2nd Symposium on System, Structure and Control, Oaxaca, 2004

2nd Symposium on System, Structure and Control, Oaxaca, 2004 263 2nd Symposium on System, Structure and Control, Oaxaca, 2004 A PROJECTIVE ALGORITHM FOR STATIC OUTPUT FEEDBACK STABILIZATION Kaiyang Yang, Robert Orsi and John B. Moore Department of Systems Engineering,

More information

Infinite elementary divisor structure-preserving transformations for polynomial matrices

Infinite elementary divisor structure-preserving transformations for polynomial matrices Infinite elementary divisor structure-preserving transformations for polynomial matrices N P Karampetakis and S Vologiannidis Aristotle University of Thessaloniki, Department of Mathematics, Thessaloniki

More information

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.

APPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2. APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product

More information

Proceedings of TOGO 2010, pp. 1??. k=1. subject to. y k g(x k ) = b, k=1. k=1

Proceedings of TOGO 2010, pp. 1??. k=1. subject to. y k g(x k ) = b, k=1. k=1 Proceedings of TOGO 2010, pp. 1??. The averaged problem Ken McKinnon, 1 and Marcel Mongeau, 2,3 1 Department of Mathematics & Statistics, University of Edinburgh, Edinburgh EH9 3JZ, UK, ken@maths.ed.ac.uk

More information

Constrained interpolation-based control for polytopic uncertain systems

Constrained interpolation-based control for polytopic uncertain systems 2011 50th IEEE Conference on Decision and Control and European Control Conference CDC-ECC Orlando FL USA December 12-15 2011 Constrained interpolation-based control for polytopic uncertain systems H.-N.

More information

Handout 8: Dealing with Data Uncertainty

Handout 8: Dealing with Data Uncertainty MFE 5100: Optimization 2015 16 First Term Handout 8: Dealing with Data Uncertainty Instructor: Anthony Man Cho So December 1, 2015 1 Introduction Conic linear programming CLP, and in particular, semidefinite

More information