Semidefinite Programming Duality and Linear Time-invariant Systems
|
|
- Samson Davidson
- 5 years ago
- Views:
Transcription
1 Semidefinite Programming Duality and Linear Time-invariant Systems Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 2 July 2004 Workshop on Linear Matrix Inequalities in Control LAAS-CNRS, Toulouse, France
2 Semidefinite Programming Duality and Linear Time-invariant Systems Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 2 July 2004 Workshop on Linear Matrix Inequalities in Control LAAS-CNRS, Toulouse, France Joint work with Lieven Vandenberghe, UCLA
3 SDP DUALITY AND LTI SYSTEMS 1 Basic ideas Many control constraints yield LMIs, many control problems are SDPs
4 SDP DUALITY AND LTI SYSTEMS 1 Basic ideas Many control constraints yield LMIs, many control problems are SDPs LMIs are convex constraints, SDPs are convex optimization problems From duality theory in convex optimization: Theorem of alternatives for LMIs SDP duality
5 SDP DUALITY AND LTI SYSTEMS 1 Basic ideas Many control constraints yield LMIs, many control problems are SDPs LMIs are convex constraints, SDPs are convex optimization problems From duality theory in convex optimization: Theorem of alternatives for LMIs SDP duality Explore implication of convex duality theory on underlying control problem: New (often simpler) proofs for classical results Some new results
6 SDP DUALITY AND LTI SYSTEMS 2 LMIs and Semidefinite Programming V is a finite-dimensional Hilbert space, S is a subspace of Hermitian matrices, F : V S is a linear mapping, F 0 S Inequality F(x) + F 0 0 is an LMI SDP is an optimization of the form: minimize: c, x V subject to: F(x) + F 0 0
7 SDP DUALITY AND LTI SYSTEMS 3 A theorem of alternatives for LMIs Exactly one of the following statements is true 1. F(x) + F 0 > 0 is feasible 2. There exists Z S s.t. Z 0, F adj (Z) = 0, F 0, Z S 0 (F adj ( ) denotes adjoint map, i.e., x V, Z S, F(x), Z S = x, F adj (Z) V )
8 SDP DUALITY AND LTI SYSTEMS 3 A theorem of alternatives for LMIs Exactly one of the following statements is true 1. F(x) + F 0 > 0 is feasible 2. There exists Z S s.t. Z 0, F adj (Z) = 0, F 0, Z S 0 (F adj ( ) denotes adjoint map, i.e., x V, Z S, F(x), Z S = x, F adj (Z) V ) Variants available for nonstrict inequalities such as F(x) + F 0 0 and F(x) + F 0 0, and with additional linear equality constraints F(x) = 0 Typically get weak alternatives, need additional conditions (constraint qualifications) to make them strong
9 SDP DUALITY AND LTI SYSTEMS 4 Proof of theorem of alternatives LMI F(x) + F 0 > 0 infeasible iff F 0 C = {C F(x) + C > 0 for some x V}
10 SDP DUALITY AND LTI SYSTEMS 4 Proof of theorem of alternatives LMI F(x) + F 0 > 0 infeasible iff F 0 C = {C F(x) + C > 0 for some x V} C is open, nonempty and convex, so there exists hyperplane strictly separting F 0 and C: Z 0 s.t. F 0, Z S < C, Z S for all C C
11 SDP DUALITY AND LTI SYSTEMS 4 Proof of theorem of alternatives LMI F(x) + F 0 > 0 infeasible iff F 0 C = {C F(x) + C > 0 for some x V} C is open, nonempty and convex, so there exists hyperplane strictly separting F 0 and C: Z 0 s.t. F 0, Z S < C, Z S for all C C Z 0 s.t. F 0, Z S < F(x) + X, Z S for all x V, X > 0
12 SDP DUALITY AND LTI SYSTEMS 4 Proof of theorem of alternatives LMI F(x) + F 0 > 0 infeasible iff F 0 C = {C F(x) + C > 0 for some x V} C is open, nonempty and convex, so there exists hyperplane strictly separting F 0 and C: Z 0 s.t. F 0, Z S < C, Z S for all C C Z 0 s.t. F 0, Z S < F(x) + X, Z S for all x V, X > 0 Z 0 s.t. F 0, Z S < x, F adj (Z) V + X, Z S for all x V, X > 0
13 SDP DUALITY AND LTI SYSTEMS 4 Proof of theorem of alternatives LMI F(x) + F 0 > 0 infeasible iff F 0 C = {C F(x) + C > 0 for some x V} C is open, nonempty and convex, so there exists hyperplane strictly separting F 0 and C: Z 0 s.t. F 0, Z S < C, Z S for all C C Z 0 s.t. F 0, Z S < F(x) + X, Z S for all x V, X > 0 Z 0 s.t. F 0, Z S < x, F adj (Z) V + X, Z S for all x V, X > 0 Thus, there exists Z S s.t. Z 0, F adj (Z) = 0, F 0, Z S 0
14 SDP DUALITY AND LTI SYSTEMS 5 Application: A Lyapunov inequality LMI A P + P A < 0 is feasible, or There exists Z s.t. Z 0, AZ + ZA = 0 Factoring Z = UU, can show AU = US, S has pure imaginary eigenvalues Thus: LMI A P + P A < 0 is infeasible if and only if A has a pure imaginary eigenvalue
15 SDP DUALITY AND LTI SYSTEMS 6 Other results P > 0, A P + P A < 0 is infeasible iff λ i (A) 0 for some i A P + P A 0 is infeasible iff A is similar to a purely imaginary diagonal matrix A P + P A 0, P 0 is infeasible iff λ i (A) 0 for all i A P + P A 0, P B = 0 is infeasible iff all uncontrollable modes of (A, B) are nondefective and correspond to imaginary eigenvalues P 0, A P + P A 0, P B = 0 is infeasible iff all uncontrollable modes of (A, B) correspond to eigenvalues with positive real part P 0, A P + P A 0, P B = 0 is infeasible iff (A, B) is controllable
16 SDP DUALITY AND LTI SYSTEMS 6 Other results P > 0, A P + P A < 0 is infeasible iff λ i (A) 0 for some i A P + P A 0 is infeasible iff A is similar to a purely imaginary diagonal matrix A P + P A 0, P 0 is infeasible iff λ i (A) 0 for all i A P + P A 0, P B = 0 is infeasible iff all uncontrollable modes of (A, B) are nondefective and correspond to imaginary eigenvalues P 0, A P + P A 0, P B = 0 is infeasible iff all uncontrollable modes of (A, B) correspond to eigenvalues with positive real part P 0, A P + P A 0, P B = 0 is infeasible iff (A, B) is controllable
17 SDP DUALITY AND LTI SYSTEMS 7 Frequency-domain inequalities: The KYP Lemma Inequalities of the form [ (jωi A) 1 B I ] M [ (jωi A) 1 B I ] > 0 are commonly encountered in systems and control: Linear system analysis and design Digital filter design Robust control analysis Examples of constraints: H(jω) < 1 (small gain), RH(jω) > 0 (passivity), H(jω) + H(jω) + H(jω) H(jω) < 1 (mixed constraints)
18 SDP DUALITY AND LTI SYSTEMS 8 The Kalman-Yakubovich-Popov Lemma FDI holds for all ω iff LMI is feasible [ (jωi A) 1 B I ] M [ A P + P A P B B P 0 [ (jωi A) 1 B ] I M < 0 ] > 0 Infinite-dimensional constraint reduced to finite-dimensional constraint No sampling in frequency required
19 SDP DUALITY AND LTI SYSTEMS 9 Control-theoretic proof of KYP Lemma Suppose LMI [ A P + P A P B B P 0 is feasible ] M < 0 Then [ ] (jωi A) 0 < 1 ( [ B A M P + P A P B I B P 0 = [ B ( jωi A ) 1 I ] [ ] (jωi A) M 1 B I ]) [ (jωi A) 1 B I ]
20 SDP DUALITY AND LTI SYSTEMS 9 Control-theoretic proof of KYP Lemma Suppose LMI [ A P + P A P B B P 0 is feasible ] M < 0 Then [ ] (jωi A) 0 < 1 ( [ B A M P + P A P B I B P 0 = [ B ( jωi A ) 1 I ] [ ] (jωi A) M 1 B I ]) [ (jωi A) 1 B I ] Converse much harder; based on optimal control theory
21 SDP DUALITY AND LTI SYSTEMS 10 New KYP lemma proof More general version of the KYP Lemma: Suppose M 22 > 0 [ A P + P A P B B P 0 is feasible iff (jωi A)u = Bv, (u, v) 0 = [ u ] M < 0, v ] M [ u v ] > 0 A can have imaginary eigenvalues If A has no imaginary eigenvalues, recover classical version
22 SDP DUALITY AND LTI SYSTEMS 11 Duality-based KYP Lemma proof Infeasibility of equivalent to existence of Z s.t. [ A P + P A P B B P 0 ] M < 0 Z = [ ] Z11 Z 12 Z12 Z 22 0, Z 11 A + AZ 11 + Z 12 B + BZ 12 = 0, TrZM 0 Must have Z Hence, factor Z as [ ] Z11 Z 12 Z12 Z 22 = [ U 0 V ˆV ] [ U V 0 ˆV ], where U has full rank
23 SDP DUALITY AND LTI SYSTEMS 12 Can show ( [ US AU = BV, Tr U V ] [ ]) U M 0, V with S + S = 0 Take Schur decomposition of S: S = m i=1 jω iq i q i, with i q iq i = I Then q k [ U V ] M [ U V ] q k 0 for some k Define u = Uq k, v = V q k. Then [ u v ] [ ] u M 0 v and (jωi A)u = Bv
24 SDP DUALITY AND LTI SYSTEMS 13 Outline Theorem of alternatives for LMIs, and their applications SDP duality, and its application
25 SDP DUALITY AND LTI SYSTEMS 14 Primal and dual SDPs Primal SDP: minimize: c, x V subject to: F(x) + F 0 0 Dual SDP maximize F 0, Z S subject to F adj (Z) = c, Z 0 If Z is dual feasible, then TrF 0 Z p If x is primal feasible, then c T x d Under mild conditions, p = d At optimum, (F(x opt ) + F 0 ) Z opt = 0
26 SDP DUALITY AND LTI SYSTEMS 15 Application of duality: Bounds on H norm Stable LTI system ẋ = Ax + Bu, x(0) = 0, y = Cx Transfer function H(s) = C(sI A) 1 B H norm of H defined as H = sup σ max (H(s)) Rs>0 H 2 equals maximum energy gain H 2 = max u y T y ut u
27 SDP DUALITY AND LTI SYSTEMS 16 H computation as an SDP minimize: subject to: β[ A P + P A + C C P B B P βi ] 0 ( H 2 = β opt ) Dual problem maximize: TrCZ 11 C subject to: Z 11 A + AZ 11 + Z 12 B + BZ12 = 0 [ Z11 Z12 ] Z 12 0, Z 22 TrZ 22 = 1
28 SDP DUALITY AND LTI SYSTEMS 17 Control-theoretic interpretation of dual problem Suppose u(t) any input that steers state from x(t 1 ) = 0 to x(t 2 ) = 0, for some T 1, T 2. Let y(t) be the corresponding output Define Z 11 = T2 T 1 x(t)x(t) dt, Z 12 = T2 T 1 x(t)u(t) dt, Z 22 = T2 T 1 u(t)u(t) dt Can show Z 11, Z 12 and Z 22 are dual feasible TrZ 22 = T 2 T 1 u(t) u(t) dt = 1 normalizes input energy Dual objective is corresponding output energy, gives lower bound: TrCZ 11 C = T2 T 1 y(t) y(t) dt
29 SDP DUALITY AND LTI SYSTEMS 18 Recall primal problem: New upper bounds on H minimize: subject to: β[ A P + P A + C C P B B P βi ] 0 A primal feasible point is P = 2W o, β = 4λ max (W o BB W o, C C) where W o is observability Gramian, obtained by solving W o A + A W o + C C = 0 Thus, new upper bound on H is given by 2 λ max (W o BB W o, C C)
30 SDP DUALITY AND LTI SYSTEMS 19 Recall dual problem New lower bounds on H maximize: TrCZ 11 C subject to: Z 11 A + AZ 11 + Z 12 B + BZ12 = 0 [ ] Z11 Z 12 Z12 0, TrZ Z 22 = 1 22 A dual feasible point is Z 11 = W c /α, Z 12 = B/(2α), Z 22 = B Wc 1 B/(4α), where α = Tr(B Wc 1 B/4) Thus new lower bound is 2 TrCW c C /(TrB W 1 c B)
31 SDP DUALITY AND LTI SYSTEMS 20 Primal Application of duality: LQR problem minimize: TrQZ 11 + TrZ 22 subject to: AZ [ 11 + BZ12 ] + Z 11 A + Z 12 B + x 0 x 0 0, Z11 Z 12 Z12 0 Z 22 Dual maximize: x[ 0P x 0 A subject to: P + P A + Q P B B P I ] 0, P 0
32 SDP DUALITY AND LTI SYSTEMS 21 The Linear-Quadratic Regulator problem ẋ = Ax + Bu, x(0) = x 0, s.t. lim t x(t) = 0 find u that minimizes J = 0 (x(t) Qx(t) + u(t) u(t)) dt, Well-known solution: Solve Riccati equation A T P + P A + Q P BB T P = 0 such that P > 0. Then, u opt (t) = B T P x(t) (Proof using quadratic optimal control theory)
33 SDP DUALITY AND LTI SYSTEMS 22 Duality-based proof: Basic ideas Primal problem gives upper bound on LQR objective Dual problem gives lower bound on LQR objective Optimality condition gives LQR Riccati equation
34 SDP DUALITY AND LTI SYSTEMS 23 Primal problem interpretation Assume u = Kx, s.t. x(t) 0 as t Then LQR objective reduces to J K = 0 x(t) (Q + K K) x(t) dt and is an upper bound on the optimum LQR objective Condition x(t) 0 as t equivalent to (A + BK) Z + Z(A + BK) + x 0 x 0 = 0, Z 0 LQR objective is Tr Z(Q + K K)
35 SDP DUALITY AND LTI SYSTEMS 24 Best upper bound using state-feedback: minimize: Tr Z(Q + K K) subject to: Z 0 (A + BK) Z + Z(A + BK) + x 0 x 0 = 0 With Z 11 = Z, Z 12 = ZK, Z 22 = K ZK : minimize: TrQZ 11 + TrZ 22 subject to: AZ [ 11 + BZ12 ] + Z 11 A + Z 12 B + x 0 x 0 0, Z11 Z 12 Z12 0 Z 22 (Same as primal problem)
36 SDP DUALITY AND LTI SYSTEMS 25 Dual problem interpretation Suppose for P 0, d dt x(t) P x(t) (x(t) Qx(t) + u(t) u(t)), for all t 0, and for all x and u satisfying ẋ = Ax + Bu, x(t ) = 0. Then, x 0P x 0 T 0 (x(t) Qx(t) + u(t) u(t)) dt, So J opt x 0P x 0 Derivative condition equivalent to LMI [ A P + P A + Q P B B P I ] 0 So lower bound to LQR objective given by dual problem
37 SDP DUALITY AND LTI SYSTEMS 26 Optimality conditions Stabilizability of (A, B) guarantees strict primal feasibility Detectability of (Q, A) guarantees strict dual feasibility Recall, at optimality (F(x opt ) + F 0 ) Z opt = 0. This becomes [ ] [ Z11 Z 12 A P + P A + Q P B Z12 Z 22 B P I Reduces to [ ] [ ] I K A P + P A + Q P B B = 0, P I or K = B P, with all the eigenvalues of A + BK having negative real part, and A P + P A + Q P BB P = 0 (Classical LQR result, derived using duality) ] = 0
38 SDP DUALITY AND LTI SYSTEMS 27 Conclusions SDP duality theory has interesting implications systems and control Implications for numerical computation: Dual problems sometimes have fewer variables Most efficient algorithms solve primal and dual together; control-theoretic interpretation can help increase efficiency
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationSemidefinite Programming Duality and Linear Time-Invariant Systems
Semidefinite Programming Duality and Linear Time-Invariant Systems Venkataramanan Balakrishnan, Member, IEEE, and Lieven Vandenberghe, Member, IEEE Abstract Several important problems in control theory
More informationDenis ARZELIER arzelier
COURSE ON LMI OPTIMIZATION WITH APPLICATIONS IN CONTROL PART II.2 LMIs IN SYSTEMS CONTROL STATE-SPACE METHODS PERFORMANCE ANALYSIS and SYNTHESIS Denis ARZELIER www.laas.fr/ arzelier arzelier@laas.fr 15
More informationModern Optimal Control
Modern Optimal Control Matthew M. Peet Arizona State University Lecture 19: Stabilization via LMIs Optimization Optimization can be posed in functional form: min x F objective function : inequality constraints
More informationLecture 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 information6.241 Dynamic Systems and Control
6.241 Dynamic Systems and Control Lecture 24: H2 Synthesis Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology May 4, 2011 E. Frazzoli (MIT) Lecture 24: H 2 Synthesis May
More informationME 234, Lyapunov and Riccati Problems. 1. This problem is to recall some facts and formulae you already know. e Aτ BB e A τ dτ
ME 234, Lyapunov and Riccati Problems. This problem is to recall some facts and formulae you already know. (a) Let A and B be matrices of appropriate dimension. Show that (A, B) is controllable if and
More informationLinear Matrix Inequalities in Robust Control. Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002
Linear Matrix Inequalities in Robust Control Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University MTNS 2002 Objective A brief introduction to LMI techniques for Robust Control Emphasis on
More information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More information16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1
16.31 Fall 2005 Lecture Presentation Mon 31-Oct-05 ver 1.1 Charles P. Coleman October 31, 2005 1 / 40 : Controllability Tests Observability Tests LEARNING OUTCOMES: Perform controllability tests Perform
More informationLecture: Duality.
Lecture: Duality http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Introduction 2/35 Lagrange dual problem weak and strong
More informationLecture 6. Foundations of LMIs in System and Control Theory
Lecture 6. Foundations of LMIs in System and Control Theory Ivan Papusha CDS270 2: Mathematical Methods in Control and System Engineering May 4, 2015 1 / 22 Logistics hw5 due this Wed, May 6 do an easy
More informationROBUST 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 informationI.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 informationBalanced Truncation 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI
More informationConvex Optimization M2
Convex Optimization M2 Lecture 3 A. d Aspremont. Convex Optimization M2. 1/49 Duality A. d Aspremont. Convex Optimization M2. 2/49 DMs DM par email: dm.daspremont@gmail.com A. d Aspremont. Convex Optimization
More informationInterior-point algorithms for semidefinite programming problems derived from the KYP lemma
Interior-point algorithms for semidefinite programming problems derived from the KYP lemma Lieven Vandenberghe, V. Ragu Balakrishnan, Ragnar Wallin, Anders Hansson, and Tae Roh Summary. We discuss fast
More informationConvex Optimization Boyd & Vandenberghe. 5. Duality
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationEE363 homework 8 solutions
EE363 Prof. S. Boyd EE363 homework 8 solutions 1. Lyapunov condition for passivity. The system described by ẋ = f(x, u), y = g(x), x() =, with u(t), y(t) R m, is said to be passive if t u(τ) T y(τ) dτ
More informationResearch Article Indefinite LQ Control for Discrete-Time Stochastic Systems via Semidefinite Programming
Mathematical Problems in Engineering Volume 2012, Article ID 674087, 14 pages doi:10.1155/2012/674087 Research Article Indefinite LQ Control for Discrete-Time Stochastic Systems via Semidefinite Programming
More informationStability of Parameter Adaptation Algorithms. Big picture
ME5895, UConn, Fall 215 Prof. Xu Chen Big picture For ˆθ (k + 1) = ˆθ (k) + [correction term] we haven t talked about whether ˆθ(k) will converge to the true value θ if k. We haven t even talked about
More informationLQR, Kalman Filter, and LQG. Postgraduate Course, M.Sc. Electrical Engineering Department College of Engineering University of Salahaddin
LQR, Kalman Filter, and LQG Postgraduate Course, M.Sc. Electrical Engineering Department College of Engineering University of Salahaddin May 2015 Linear Quadratic Regulator (LQR) Consider a linear system
More informationRank-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 information7.1 Linear Systems Stability Consider the Continuous-Time (CT) Linear Time-Invariant (LTI) system
7 Stability 7.1 Linear Systems Stability Consider the Continuous-Time (CT) Linear Time-Invariant (LTI) system ẋ(t) = A x(t), x(0) = x 0, A R n n, x 0 R n. (14) The origin x = 0 is a globally asymptotically
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 4
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 4 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory April 12, 2012 Andre Tkacenko
More informationarzelier
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 informationNonlinear Control. Nonlinear Control Lecture # 6 Passivity and Input-Output Stability
Nonlinear Control Lecture # 6 Passivity and Input-Output Stability Passivity: Memoryless Functions y y y u u u (a) (b) (c) Passive Passive Not passive y = h(t,u), h [0, ] Vector case: y = h(t,u), h T =
More informationIntroduction to Nonlinear Control Lecture # 4 Passivity
p. 1/6 Introduction to Nonlinear Control Lecture # 4 Passivity È p. 2/6 Memoryless Functions ¹ y È Ý Ù È È È È u (b) µ power inflow = uy Resistor is passive if uy 0 p. 3/6 y y y u u u (a) (b) (c) Passive
More informationA Study of the Duality between Kalman Filters and LQR Problems
Purdue University Purdue e-pubs Department of Electrical and Computer Engineering Technical Reports Department of Electrical and Computer Engineering 11-3-2016 A Study of the Duality between Kalman Filters
More informationQuadratic Stability of Dynamical Systems. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
.. Quadratic Stability of Dynamical Systems Raktim Bhattacharya Aerospace Engineering, Texas A&M University Quadratic Lyapunov Functions Quadratic Stability Dynamical system is quadratically stable if
More informationModule 02 CPS Background: Linear Systems Preliminaries
Module 02 CPS Background: Linear Systems Preliminaries Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html August
More informationModel reduction for linear systems by balancing
Model reduction for linear systems by balancing Bart Besselink Jan C. Willems Center for Systems and Control Johann Bernoulli Institute for Mathematics and Computer Science University of Groningen, Groningen,
More informationSemidefinite 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 informationLMI 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 informationFrom 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 informationIEOR 265 Lecture 14 (Robust) Linear Tube MPC
IEOR 265 Lecture 14 (Robust) Linear Tube MPC 1 LTI System with Uncertainty Suppose we have an LTI system in discrete time with disturbance: x n+1 = Ax n + Bu n + d n, where d n W for a bounded polytope
More informationRobust Multivariable Control
Lecture 2 Anders Helmersson anders.helmersson@liu.se ISY/Reglerteknik Linköpings universitet Today s topics Today s topics Norms Today s topics Norms Representation of dynamic systems Today s topics Norms
More informationLagrange Duality. Daniel P. Palomar. Hong Kong University of Science and Technology (HKUST)
Lagrange Duality Daniel P. Palomar Hong Kong University of Science and Technology (HKUST) ELEC5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture Lagrangian Dual function Dual
More informationRaktim Bhattacharya. . AERO 632: Design of Advance Flight Control System. Norms for Signals and Systems
. AERO 632: Design of Advance Flight Control System Norms for Signals and. Raktim Bhattacharya Laboratory For Uncertainty Quantification Aerospace Engineering, Texas A&M University. Norms for Signals ...
More information1 Continuous-time Systems
Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output
More informationJune 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 informationCME 345: MODEL REDUCTION
CME 345: MODEL REDUCTION Balanced Truncation Charbel Farhat & David Amsallem Stanford University cfarhat@stanford.edu These slides are based on the recommended textbook: A.C. Antoulas, Approximation of
More informationThe norms can also be characterized in terms of Riccati inequalities.
9 Analysis of stability and H norms Consider the causal, linear, time-invariant system ẋ(t = Ax(t + Bu(t y(t = Cx(t Denote the transfer function G(s := C (si A 1 B. Theorem 85 The following statements
More informationA Characterization of the Hurwitz Stability of Metzler Matrices
29 American Control Conference Hyatt Regency Riverfront, St Louis, MO, USA June -2, 29 WeC52 A Characterization of the Hurwitz Stability of Metzler Matrices Kumpati S Narendra and Robert Shorten 2 Abstract
More informationUSE OF SEMIDEFINITE PROGRAMMING FOR SOLVING THE LQR PROBLEM SUBJECT TO RECTANGULAR DESCRIPTOR SYSTEMS
Int. J. Appl. Math. Comput. Sci. 21 Vol. 2 No. 4 655 664 DOI: 1.2478/v16-1-48-9 USE OF SEMIDEFINITE PROGRAMMING FOR SOLVING THE LQR PROBLEM SUBJECT TO RECTANGULAR DESCRIPTOR SYSTEMS MUHAFZAN Department
More information4F3 - Predictive Control
4F3 Predictive Control - Lecture 2 p 1/23 4F3 - Predictive Control Lecture 2 - Unconstrained Predictive Control Jan Maciejowski jmm@engcamacuk 4F3 Predictive Control - Lecture 2 p 2/23 References Predictive
More information6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC
6-1 The Positivstellensatz P. Parrilo and S. Lall, ECC 2003 2003.09.02.10 6. The Positivstellensatz Basic semialgebraic sets Semialgebraic sets Tarski-Seidenberg and quantifier elimination Feasibility
More informationEE 227A: Convex Optimization and Applications October 14, 2008
EE 227A: Convex Optimization and Applications October 14, 2008 Lecture 13: SDP Duality Lecturer: Laurent El Ghaoui Reading assignment: Chapter 5 of BV. 13.1 Direct approach 13.1.1 Primal problem Consider
More informationRobust Control 5 Nominal Controller Design Continued
Robust Control 5 Nominal Controller Design Continued Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University 4/14/2003 Outline he LQR Problem A Generalization to LQR Min-Max
More informationThe Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications
MAX PLANCK INSTITUTE Elgersburg Workshop Elgersburg February 11-14, 2013 The Kalman-Yakubovich-Popov Lemma for Differential-Algebraic Equations with Applications Timo Reis 1 Matthias Voigt 2 1 Department
More informationLecture 14: Optimality Conditions for Conic Problems
EE 227A: Conve Optimization and Applications March 6, 2012 Lecture 14: Optimality Conditions for Conic Problems Lecturer: Laurent El Ghaoui Reading assignment: 5.5 of BV. 14.1 Optimality for Conic Problems
More informationMathematics for Control Theory
Mathematics for Control Theory Outline of Dissipativity and Passivity Hanz Richter Mechanical Engineering Department Cleveland State University Reading materials Only as a reference: Charles A. Desoer
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science : Dynamic Systems Spring 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.4: Dynamic Systems Spring Homework Solutions Exercise 3. a) We are given the single input LTI system: [
More informationProblem structure in semidefinite programs arising in control and signal processing
Problem structure in semidefinite programs arising in control and signal processing Lieven Vandenberghe Electrical Engineering Department, UCLA Joint work with: Mehrdad Nouralishahi, Tae Roh Semidefinite
More informationControllability, Observability, Full State Feedback, Observer Based Control
Multivariable Control Lecture 4 Controllability, Observability, Full State Feedback, Observer Based Control John T. Wen September 13, 24 Ref: 3.2-3.4 of Text Controllability ẋ = Ax + Bu; x() = x. At time
More informationChapter 3. LQ, LQG and Control System Design. Dutch Institute of Systems and Control
Chapter 3 LQ, LQG and Control System H 2 Design Overview LQ optimization state feedback LQG optimization output feedback H 2 optimization non-stochastic version of LQG Application to feedback system design
More informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationModern Optimal Control
Modern Optimal Control Matthew M. Peet Arizona State University Lecture 22: H 2, LQG and LGR Conclusion To solve the H -optimal state-feedback problem, we solve min γ such that γ,x 1,Y 1,A n,b n,c n,d
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 6. Suvrit Sra. (Conic optimization) 07 Feb, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 6 (Conic optimization) 07 Feb, 2013 Suvrit Sra Organizational Info Quiz coming up on 19th Feb. Project teams by 19th Feb Good if you can mix your research
More informationJoão P. Hespanha. January 16, 2009
LINEAR SYSTEMS THEORY João P. Hespanha January 16, 2009 Disclaimer: This is a draft and probably contains a few typos. Comments and information about typos are welcome. Please contact the author at hespanha@ece.ucsb.edu.
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationObservability. It was the property in Lyapunov stability which allowed us to resolve that
Observability We have seen observability twice already It was the property which permitted us to retrieve the initial state from the initial data {u(0),y(0),u(1),y(1),...,u(n 1),y(n 1)} It was the property
More informationE5295/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 informationLecture: Duality of LP, SOCP and SDP
1/33 Lecture: Duality of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2017.html wenzw@pku.edu.cn Acknowledgement:
More informationHankel Optimal Model Reduction 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Hankel Optimal Model Reduction 1 This lecture covers both the theory and
More information6 OUTPUT FEEDBACK DESIGN
6 OUTPUT FEEDBACK DESIGN When the whole sate vector is not available for feedback, i.e, we can measure only y = Cx. 6.1 Review of observer design Recall from the first class in linear systems that a simple
More informationTopic # Feedback Control Systems
Topic #17 16.31 Feedback Control Systems Deterministic LQR Optimal control and the Riccati equation Weight Selection Fall 2007 16.31 17 1 Linear Quadratic Regulator (LQR) Have seen the solutions to the
More informationEE363 homework 7 solutions
EE363 Prof. S. Boyd EE363 homework 7 solutions 1. Gain margin for a linear quadratic regulator. Let K be the optimal state feedback gain for the LQR problem with system ẋ = Ax + Bu, state cost matrix Q,
More information15. Conic optimization
L. Vandenberghe EE236C (Spring 216) 15. Conic optimization conic linear program examples modeling duality 15-1 Generalized (conic) inequalities Conic inequality: a constraint x K where K is a convex cone
More informationDissipative Systems Analysis and Control
Bernard Brogliato, Rogelio Lozano, Bernhard Maschke and Olav Egeland Dissipative Systems Analysis and Control Theory and Applications 2nd Edition With 94 Figures 4y Sprin er 1 Introduction 1 1.1 Example
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationKalman Decomposition B 2. z = T 1 x, where C = ( C. z + u (7) T 1, and. where B = T, and
Kalman Decomposition Controllable / uncontrollable decomposition Suppose that the controllability matrix C R n n of a system has rank n 1
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationLinear 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 informationLINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE
LINEAR-QUADRATIC OPTIMAL CONTROL OF DIFFERENTIAL-ALGEBRAIC SYSTEMS: THE INFINITE TIME HORIZON PROBLEM WITH ZERO TERMINAL STATE TIMO REIS AND MATTHIAS VOIGT, Abstract. In this work we revisit the linear-quadratic
More informationSubject: Optimal Control Assignment-1 (Related to Lecture notes 1-10)
Subject: Optimal Control Assignment- (Related to Lecture notes -). Design a oil mug, shown in fig., to hold as much oil possible. The height and radius of the mug should not be more than 6cm. The mug must
More informationLecture 7: Semidefinite programming
CS 766/QIC 820 Theory of Quantum Information (Fall 2011) Lecture 7: Semidefinite programming This lecture is on semidefinite programming, which is a powerful technique from both an analytic and computational
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationAppendix A Solving Linear Matrix Inequality (LMI) Problems
Appendix A Solving Linear Matrix Inequality (LMI) Problems In this section, we present a brief introduction about linear matrix inequalities which have been used extensively to solve the FDI problems described
More informationLinear-quadratic control problem with a linear term on semiinfinite interval: theory and applications
Linear-quadratic control problem with a linear term on semiinfinite interval: theory and applications L. Faybusovich T. Mouktonglang Department of Mathematics, University of Notre Dame, Notre Dame, IN
More informationContents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31
Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization
More informationSynthesis of Static Output Feedback SPR Systems via LQR Weighting Matrix Design
49th IEEE Conference on Decision and Control December 15-17, 21 Hilton Atlanta Hotel, Atlanta, GA, USA Synthesis of Static Output Feedback SPR Systems via LQR Weighting Matrix Design Jen-te Yu, Ming-Li
More informationOPTIMAL CONTROL. Sadegh Bolouki. Lecture slides for ECE 515. University of Illinois, Urbana-Champaign. Fall S. Bolouki (UIUC) 1 / 28
OPTIMAL CONTROL Sadegh Bolouki Lecture slides for ECE 515 University of Illinois, Urbana-Champaign Fall 2016 S. Bolouki (UIUC) 1 / 28 (Example from Optimal Control Theory, Kirk) Objective: To get from
More informationSummer School: Semidefinite Optimization
Summer School: Semidefinite Optimization Christine Bachoc Université Bordeaux I, IMB Research Training Group Experimental and Constructive Algebra Haus Karrenberg, Sept. 3 - Sept. 7, 2012 Duality Theory
More informationCDS Solutions to the Midterm Exam
CDS 22 - Solutions to the Midterm Exam Instructor: Danielle C. Tarraf November 6, 27 Problem (a) Recall that the H norm of a transfer function is time-delay invariant. Hence: ( ) Ĝ(s) = s + a = sup /2
More informationH 2 Optimal State Feedback Control Synthesis. Raktim Bhattacharya Aerospace Engineering, Texas A&M University
H 2 Optimal State Feedback Control Synthesis Raktim Bhattacharya Aerospace Engineering, Texas A&M University Motivation Motivation w(t) u(t) G K y(t) z(t) w(t) are exogenous signals reference, process
More informationModule 07 Controllability and Controller Design of Dynamical LTI Systems
Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October
More informationLecture 8. Strong Duality Results. September 22, 2008
Strong Duality Results September 22, 2008 Outline Lecture 8 Slater Condition and its Variations Convex Objective with Linear Inequality Constraints Quadratic Objective over Quadratic Constraints Representation
More informationSEMIDEFINITE PROGRAM BASICS. Contents
SEMIDEFINITE PROGRAM BASICS BRIAN AXELROD Abstract. A introduction to the basics of Semidefinite programs. Contents 1. Definitions and Preliminaries 1 1.1. Linear Algebra 1 1.2. Convex Analysis (on R n
More informationH 2 Suboptimal Estimation and Control for Nonnegative
Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 FrC20.3 H 2 Suboptimal Estimation and Control for Nonnegative Dynamical Systems
More informationẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)
EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and
More informationGrammians. Matthew M. Peet. Lecture 20: Grammians. Illinois Institute of Technology
Grammians Matthew M. Peet Illinois Institute of Technology Lecture 2: Grammians Lyapunov Equations Proposition 1. Suppose A is Hurwitz and Q is a square matrix. Then X = e AT s Qe As ds is the unique solution
More information2nd 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 informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationMapping MIMO control system specifications into parameter space
Mapping MIMO control system specifications into parameter space Michael Muhler 1 Abstract This paper considers the mapping of design objectives for parametric multi-input multi-output systems into parameter
More informationEE Applications of Convex Optimization in Signal Processing and Communications Dr. Andre Tkacenko, JPL Third Term
EE 150 - Applications of Convex Optimization in Signal Processing and Communications Dr. Andre Tkacenko JPL Third Term 2011-2012 Due on Thursday May 3 in class. Homework Set #4 1. (10 points) (Adapted
More informationConvex Optimization 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.245: MULTIVARIABLE CONTROL SYSTEMS by A. Megretski Convex Optimization 1 Many optimization objectives generated
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationLinear and non-linear programming
Linear and non-linear programming Benjamin Recht March 11, 2005 The Gameplan Constrained Optimization Convexity Duality Applications/Taxonomy 1 Constrained Optimization minimize f(x) subject to g j (x)
More information