Convex computation of the region of attraction for polynomial control systems
|
|
- Lionel Dean
- 5 years ago
- Views:
Transcription
1 Convex computation of the region of attraction for polynomial control systems Didier Henrion LAAS-CNRS Toulouse & CTU Prague Milan Korda EPFL Lausanne
2 Region of Attraction (ROA) ẋ = f (x,u), x(t) X, u(t) U t [0,T] x(t ) X T Region of attraction (ROA) a.k.a. Backward reachable set The set of all initial states that can be admissibly steered to the target set at a given time X X T X 0 2
3 Region of Attraction (ROA) ẋ = f (x,u), x(t) X, u(t) U t [0,T] x(t ) X T 3
4 Region of Attraction (ROA) Fundamentally difficult to determine!! Long history - typically tackled using non-convex BMIs or gridding Convex formulation Infinite dimensional LP formulation for ROA computation Converging hierarchy of SDP relaxations providing outer approximations! Readily modeled using freely available tools (Gloptipoly, Yalmip, etc.)! No initialization data required! 4
5 How is it done? 5
6 Approach Approach Study how ensembles of initial conditions evolve, not single trajectories How to model these ensembles? Using measures.! 6
7 Measures Mappings from sets to real numbers Measures µ R Integration A g(x) dµ(x) g(x) dµ(x) = A A g(x) ρ(x)dx (x) 1 µ 7
8 Measures in control µ 0 µ T T µ (t,x(t),u(t)) [0,T] X U x µ T µ 0 0 T t 8
9 Measures in control µ 0 µ T T µ (t,x(t),u(t)) [0,T] X U x µ T µ 0 0 T t 9
10 Liouville s equation µ 0 µ µ T X v(t,x) dµ T (x) v C 1 ([0,T] X) X v(0,x) dµ 0 (x) = [0,T ] X U v t + xv f Lv(t,x,u) dµ(t,x,u) Key fact ẋ = f (x,u) Optimization over system trajectories Optimization over measures satisfying Liouville s equation 10
11 Characterization of ROA using measures 11
12 Dynamics Dynamics Liouville s equation 12
13 Constraints Constraints Support constraints Support of a measure Smallest closed set whose complement has zero measure spt µ x(0) X (x(t),u(t)) X U x(t ) X T spt µ 0 X spt µ [0,T] X U spt µ T X T 13
14 Characterization of ROA using measures Need to µ 0 Non-convex 14
15 Convex characterization of ROA Key idea µ 0 µ 0 15
16 Convex characterization of ROA Key idea µ 0 µ 0 X 0 1 X 0 X 16
17 Convex characterization of ROA Key idea µ 0 µ 0 X 0 1 X 0 X 17
18 Convex characterization of ROA Key idea µ 0 µ 0 X 0 1 X 0 X 18
19 Convex characterization of ROA Key idea µ 0 µ 0 X 0 1 X 0 X 19
20 Convex characterization of ROA Key idea µ 0 µ 0 X 0 1 X 0 X 20
21 Primal LP The ROA is characterized by the optimization problem sup µ 0 (X) Primal LP s.t. X T vdµ T X vdµ 0 = [0,T ] X U Lvdµ v C 1 µ 0 µ 0, µ 0 0,µ T 0, ˆµ 0 0 spt µ [0,T] X U, spt µ 0 X, spt µ T X T Infinite dimensional linear program in the cone of nonnegative measures 21
22 Dual LP on continuous functions Decrease along trajectories inf X w(x) dx Dual LP s.t. Lv(t,x,u) 0, (t,x,u) [0,T] X U w(x) v(0,x)+1, x X v(t,x) 0, x X T w(x) 0, x X, v C 1 ([0,T] X) w C(X) {x w(x) Key observation 1} X 0 w Important fact 22
23 Finite dimensional SDP relaxations SDP! Optimization over measures Optimization over moment sequences Optimization over truncated moment sequences Duality Optimization over nonnegative continuous functions Optimization over nonnegative polynomials SDP! Optimization over SOS polynomials Duality 23
24 Big picture Infinite dimensional Infinite dimensional 2k 2k k k 24
25 Convergence results Convergence of primal and dual relaxations Optimal values of the primal and dual SDPs converge to the optimal value of the two infinite dimensional LPs, which is equal to the volume of the ROA X 0 w k (x) k Functional convergence w k I X0 L 1 min i k w i I X0 k X 0k := {x w k (x) 1} Set-wise convergence X 0k X 0 volume(x 0k \ X 0 ) 0 k 25
26 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T =
27 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction 27
28 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction X d = 10 d =
29 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction X d =
30 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction X d =
31 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction X d =
32 Numerical examples Backward Van der Pol oscillator ẋ 1 = 2x 2 ẋ 2 =0.8x (x )x 2 X =[ 1.2, 1.2] 2 X T = {x x }, T = 100 Stable equilibrium at the origin with a bounded region of attraction 18 I X0 32
33 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T =1 33
34 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T =1 V (x) = X 0 = {x : V (x) 1} x 2 +2 x x 2 2 x x 2 x 2 > 0, x 2 +2 x x
35 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T = V (x) = X 0 = {x : V (x) 1} x 2 +2 x x 2 2 x x 2 x 2 > 0, x 2 +2 x x 2 2. d =
36 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T = V (x) = X 0 = {x : V (x) 1} x 2 +2 x x 2 2 x x 2 x 2 > 0, x 2 +2 x x 2 2. d =
37 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T = V (x) = X 0 = {x : V (x) 1} x 2 +2 x x 2 2 x x 2 x 2 > 0, x 2 +2 x x 2 2. d =
38 Numerical examples Double integrator ẋ 1 = x 2 ẋ 2 = u X =[ 0.7, 0.7] [ 1.2, 1.2] U =[ 1, 1] X T = {0}, T = V (x) = X 0 = {x : V (x) 1} x 2 +2 x x 2 2 x x 2 x 2 > 0, x 2 +2 x x 2 2. d =
39 Numerical examples Brocket integrator ẋ 1 = u 1 ẋ 2 = u 2 ẋ 3 = u 1 x 2 u 2 x 1 X = {x x 1} U = {u u 2 1} X T = {0}, T =1 ROA known semi-analytically d =6 39
40 Numerical examples Brocket integrator ẋ 1 = u 1 ẋ 2 = u 2 ẋ 3 = u 1 x 2 u 2 x 1 X = {x x 1} U = {u u 2 1} X T = {0}, T =1 ROA known semi-analytically d = 10 40
41 Numerical examples x 2 u 2 u 1 u 2 x 1 u 1 u 2 d =6 41
42 Numerical examples x 2 u 2 u 1 u 2 x 1 u 1 u 2 d =8 42
43 Computational complexity ẋ = f (x,u) n+m+1+d/2 d/2 ẋ = f (x)+g(x)u n+1+d/2 d/2 d n O((n + m + 1) d/2 ) O((d/2) n+m+1 ) d n O((n + 1) d/2 ) O((d/2) n+1 ) Single SDP block of this size + number of smaller blocks Number of blocks of this size linear in the number of inputs [A. Majumdar, et al., 2013] 43
44 Extensions Reachability Invariance Inner approximations Rational or trigonometric dynamics Uncertain and stochastic systems Piecewise polynomial dynamics defined over semialgebraic partition? 44
45 Conclusion Convex characterization of the ROA Guaranteed convergence of finite dimensional relaxations Additional properties (e.g. convexity) can be easily enforced Covers a broad class of systems Extremely simple to use! 45
46 Question time 46
Convex computation of the region of attraction for polynomial control systems
Convex computation of the region of attraction for polynomial control systems Didier Henrion LAAS-CNRS Toulouse & CTU Prague Milan Korda EPFL Lausanne Region of Attraction (ROA) ẋ = f (x,u), x(t) X, u(t)
More informationRegion of attraction approximations for polynomial dynamical systems
Region of attraction approximations for polynomial dynamical systems Milan Korda EPFL Lausanne Didier Henrion LAAS-CNRS Toulouse & CTU Prague Colin N. Jones EPFL Lausanne Region of Attraction (ROA) ẋ(t)
More informationConvex computation of the region of attraction of polynomial control systems
Convex computation of the region of attraction of polynomial control systems Didier Henrion 1,2,3, Milan Korda 4 Draft of July 15, 213 Abstract We address the long-standing problem of computing the region
More informationController design and region of attraction estimation for nonlinear dynamical systems
Controller design and region of attraction estimation for nonlinear dynamical systems Milan Korda 1, Didier Henrion 2,3,4, Colin N. Jones 1 ariv:1310.2213v1 [math.oc] 8 Oct 2013 Draft of December 16, 2013
More informationController design and region of attraction estimation for nonlinear dynamical systems
Controller design and region of attraction estimation for nonlinear dynamical systems Milan Korda 1, Didier Henrion 2,3,4, Colin N. Jones 1 ariv:1310.2213v2 [math.oc] 20 Mar 2014 Draft of March 21, 2014
More informationInner approximations of the region of attraction for polynomial dynamical systems
Inner approimations of the region of attraction for polynomial dynamical systems Milan Korda, Didier Henrion 2,3,4, Colin N. Jones October, 22 Abstract hal-74798, version - Oct 22 In a previous work we
More informationConvex computation of the region of attraction of polynomial control systems
Convex computation of the region of attraction of polynomial control systems Didier Henrion 1,2,3, Milan Korda 4 ariv:128.1751v1 [math.oc] 8 Aug 212 Draft of August 9, 212 Abstract We address the long-standing
More informationMeasures and LMIs for optimal control of piecewise-affine systems
Measures and LMIs for optimal control of piecewise-affine systems M. Rasheed Abdalmoaty 1, Didier Henrion 2, Luis Rodrigues 3 November 14, 2012 Abstract This paper considers the class of deterministic
More informationLinear conic optimization for nonlinear optimal control
Linear conic optimization for nonlinear optimal control Didier Henrion 1,2,3, Edouard Pauwels 1,2 Draft of July 15, 2014 Abstract Infinite-dimensional linear conic formulations are described for nonlinear
More informationInner approximations of the maximal positively invariant set for polynomial dynamical systems
arxiv:1903.04798v1 [math.oc] 12 Mar 2019 Inner approximations of the maximal positively invariant set for polynomial dynamical systems Antoine Oustry 1, Matteo Tacchi 2, and Didier Henrion 3 March 13,
More informationConvex computation of the maximum controlled invariant set for discrete-time polynomial control systems
Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems Milan Korda 1, Didier Henrion 2,3,4, Colin N. Jones 1 Abstract We characterize the maximum controlled
More informationMaximal Positive Invariant Set Determination for Transient Stability Assessment in Power Systems
Maximal Positive Invariant Set Determination for Transient Stability Assessment in Power Systems arxiv:8.8722v [math.oc] 2 Nov 28 Antoine Oustry Ecole Polytechnique Palaiseau, France antoine.oustry@polytechnique.edu
More informationarxiv: v1 [math.oc] 31 Jan 2017
CONVEX CONSTRAINED SEMIALGEBRAIC VOLUME OPTIMIZATION: APPLICATION IN SYSTEMS AND CONTROL 1 Ashkan Jasour, Constantino Lagoa School of Electrical Engineering and Computer Science, Pennsylvania State University
More informationA new look at nonnegativity on closed sets
A new look at nonnegativity on closed sets LAAS-CNRS and Institute of Mathematics, Toulouse, France IPAM, UCLA September 2010 Positivstellensatze for semi-algebraic sets K R n from the knowledge of defining
More informationStrong 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 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 informationarxiv: v2 [cs.sy] 26 Jul 2018
Controller Synthesis for Discrete-Time Polynomial Systems via Occupation Measures Weiqiao Han and Russ Tedrake ariv:83.9v [cs.sy] 6 Jul 8 Abstract In this paper, we design nonlinear state feedback controllers
More informationSemidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems arxiv:1703.05085v2 [math.oc] 13 Feb 2018 Victor Magron 1 Pierre-Loic Garoche 2 Didier Henrion 3,4 Xavier Thirioux 5 September
More informationConvex Optimization of Nonlinear Feedback Controllers via Occupation Measures
Convex Optimization of Nonlinear Feedback Controllers via Occupation Measures Anirudha Majumdar, Ram Vasudevan, Mark M. Tobenkin, and Russ Tedrake Computer Science and Artificial Intelligence Lab Massachusetts
More informationConvergence 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 informationarxiv:math/ v1 [math.oc] 13 Mar 2007
arxiv:math/0703377v1 [math.oc] 13 Mar 2007 NONLINEAR OPTIMAL CONTROL VIA OCCUPATION MEASURES AND LMI-RELAXATIONS JEAN B. LASSERRE, DIDIER HENRION, CHRISTOPHE PRIEUR, AND EMMANUEL TRÉLAT Abstract. We consider
More informationc 2008 Society for Industrial and Applied Mathematics
SIAM J. CONTROL OPTIM. Vol. 0, No. 0, pp. 000 000 c 2008 Society for Industrial and Applied Mathematics NONLINEAR OPTIMAL CONTROL VIA OCCUPATION MEASURES AND LMI-RELAXATIONS JEAN B. LASSERRE, DIDIER HENRION,
More informationMoments and convex optimization for analysis and control of nonlinear partial differential equations
Moments and convex optimization for analysis and control of nonlinear partial differential equations Milan Korda 1, Didier Henrion 2,3,4, Jean Bernard Lasserre 2 April 19, 2018 Abstract This work presents
More informationMoments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations
Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France EECI Course: February 2016 LP-relaxations LP- VERSUS SDP-relaxations
More informationSemidenite Approximations of Reachable Sets for Discrete-time Polynomial Systems
Semidenite Approximations of Reachable Sets for Discrete-time Polynomial Systems Victor Magron 1 Pierre-Loic Garoche 2 Didier Henrion 3,4 Xavier Thirioux 5 March 15, 2017 Abstract We consider the problem
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationMoments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations
Moments and Positive Polynomials for Optimization II: LP- VERSUS SDP-relaxations LAAS-CNRS and Institute of Mathematics, Toulouse, France Tutorial, IMS, Singapore 2012 LP-relaxations LP- VERSUS SDP-relaxations
More informationCOURSE 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 informationGlobal Optimization with Polynomials
Global Optimization with Polynomials Geoffrey Schiebinger, Stephen Kemmerling Math 301, 2010/2011 March 16, 2011 Geoffrey Schiebinger, Stephen Kemmerling (Math Global 301, 2010/2011) Optimization with
More informationSemialgebraic Relaxations using Moment-SOS Hierarchies
Semialgebraic Relaxations using Moment-SOS Hierarchies Victor Magron, Postdoc LAAS-CNRS 17 September 2014 SIERRA Seminar Laboratoire d Informatique de l Ecole Normale Superieure y b sin( par + b) b 1 1
More informationLecture 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 informationSemidefinite Programming Duality and Linear Time-invariant Systems
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,
More informationThe 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 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 informationModal occupation measures and LMI relaxations for nonlinear switched systems control
Modal occupation measures and LMI relaxations for nonlinear switched systems control Mathieu Claeys 1, Jamal Daafouz 2, Didier Henrion 3,4,5 Updated version of November 16, 2016 Abstract This paper presents
More informationFormal Proofs, Program Analysis and Moment-SOS Relaxations
Formal Proofs, Program Analysis and Moment-SOS Relaxations Victor Magron, Postdoc LAAS-CNRS 15 July 2014 Imperial College Department of Electrical and Electronic Eng. y b sin( par + b) b 1 1 b1 b2 par
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 informationarxiv: v1 [math.ds] 23 Apr 2017
Estimating the Region of Attraction Using Polynomial Optimization: a Converse Lyapunov Result Hesameddin Mohammadi, Matthew M. Peet arxiv:1704.06983v1 [math.ds] 23 Apr 2017 Abstract In this paper, we propose
More informationOptimization for Communications and Networks. Poompat Saengudomlert. Session 4 Duality and Lagrange Multipliers
Optimization for Communications and Networks Poompat Saengudomlert Session 4 Duality and Lagrange Multipliers P Saengudomlert (2015) Optimization Session 4 1 / 14 24 Dual Problems Consider a primal convex
More informationConvex Computation of the Reachable Set for Controlled Polynomial Hybrid Systems
Convex Computation of the Reachable Set for Controlled Polynomial Hybrid Systems Victor Shia, Ram Vasudevan, Ruzena Bajcsy, and Russ Tedrake Abstract This paper presents an approach to computing the time-limited
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 informationIterative LP and SOCP-based. approximations to. sum of squares programs. Georgina Hall Princeton University. Joint work with:
Iterative LP and SOCP-based approximations to sum of squares programs Georgina Hall Princeton University Joint work with: Amir Ali Ahmadi (Princeton University) Sanjeeb Dash (IBM) Sum of squares programs
More informationSimple Approximations of Semialgebraic Sets and their Applications to Control
Simple Approximations of Semialgebraic Sets and their Applications to Control Fabrizio Dabbene 1 Didier Henrion 2,3,4 Constantino Lagoa 5 arxiv:1509.04200v1 [math.oc] 14 Sep 2015 October 15, 2018 Abstract
More informationThe Big Picture. Discuss Examples of unpredictability. Odds, Stanisław Lem, The New Yorker (1974) Chaos, Scientific American (1986)
The Big Picture Discuss Examples of unpredictability Odds, Stanisław Lem, The New Yorker (1974) Chaos, Scientific American (1986) Lecture 2: Natural Computation & Self-Organization, Physics 256A (Winter
More informationApproximate Optimal Designs for Multivariate Polynomial Regression
Approximate Optimal Designs for Multivariate Polynomial Regression Fabrice Gamboa Collaboration with: Yohan de Castro, Didier Henrion, Roxana Hess, Jean-Bernard Lasserre Universität Potsdam 16th of February
More informationSum of Squares Relaxations for Polynomial Semi-definite Programming
Sum of Squares Relaxations for Polynomial Semi-definite Programming C.W.J. Hol, C.W. Scherer Delft University of Technology, Delft Center of Systems and Control (DCSC) Mekelweg 2, 2628CD Delft, The Netherlands
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More informationModal occupation measures and LMI relaxations for nonlinear switched systems control
Modal occupation measures and LMI relaxations for nonlinear switched systems control Mathieu Claeys 1, Jamal Daafouz 2, Didier Henrion 3,4,5 Draft of April 17, 2014 Abstract This paper presents a linear
More informationOptimization over Nonnegative Polynomials: Algorithms and Applications. Amir Ali Ahmadi Princeton, ORFE
Optimization over Nonnegative Polynomials: Algorithms and Applications Amir Ali Ahmadi Princeton, ORFE INFORMS Optimization Society Conference (Tutorial Talk) Princeton University March 17, 2016 1 Optimization
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 informationPolynomial level-set methods for nonlinear dynamical systems analysis
Proceedings of the Allerton Conference on Communication, Control and Computing pages 64 649, 8-3 September 5. 5.7..4 Polynomial level-set methods for nonlinear dynamical systems analysis Ta-Chung Wang,4
More informationLecture: Examples of LP, SOCP and SDP
1/34 Lecture: Examples of LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:
More informationarxiv: v2 [math.oc] 30 Sep 2015
Symmetry, Integrability and Geometry: Methods and Applications Moments and Legendre Fourier Series for Measures Supported on Curves Jean B. LASSERRE SIGMA 11 (215), 77, 1 pages arxiv:158.6884v2 [math.oc]
More informationSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization Instructor: Farid Alizadeh Author: Ai Kagawa 12/12/2012
More informationOptimization over Polynomials with Sums of Squares and Moment Matrices
Optimization over Polynomials with Sums of Squares and Moment Matrices Monique Laurent Centrum Wiskunde & Informatica (CWI), Amsterdam and University of Tilburg Positivity, Valuations and Quadratic Forms
More informationRobust Multi-Objective Control for Linear Systems
Robust Multi-Objective Control for Linear Systems Elements of theory and ROMULOC toolbox Dimitri PEAUCELLE & Denis ARZELIER LAAS-CNRS, Toulouse, FRANCE Part of the OLOCEP project (includes GloptiPoly)
More informationFast ADMM for Sum of Squares Programs Using Partial Orthogonality
Fast ADMM for Sum of Squares Programs Using Partial Orthogonality Antonis Papachristodoulou Department of Engineering Science University of Oxford www.eng.ox.ac.uk/control/sysos antonis@eng.ox.ac.uk with
More informationAnalytical Validation Tools for Safety Critical Systems
Analytical Validation Tools for Safety Critical Systems Peter Seiler and Gary Balas Department of Aerospace Engineering & Mechanics, University of Minnesota, Minneapolis, MN, 55455, USA Andrew Packard
More informationMean squared error minimization for inverse moment problems
Mean squared error minimization for inverse moment problems Didier Henrion 1,2,3, Jean B. Lasserre 1,2,4, Martin Mevissen 5 June 19, 2013 Abstract We consider the problem of approximating the unknown density
More informationExact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems
Exact SDP Relaxations for Classes of Nonlinear Semidefinite Programming Problems V. Jeyakumar and G. Li Revised Version:August 31, 2012 Abstract An exact semidefinite linear programming (SDP) relaxation
More informationAdvanced SDPs Lecture 6: March 16, 2017
Advanced SDPs Lecture 6: March 16, 2017 Lecturers: Nikhil Bansal and Daniel Dadush Scribe: Daniel Dadush 6.1 Notation Let N = {0, 1,... } denote the set of non-negative integers. For α N n, define the
More informationContinuous Optimisation, Chpt 9: Semidefinite Optimisation
Continuous Optimisation, Chpt 9: Semidefinite Optimisation Peter J.C. Dickinson DMMP, University of Twente p.j.c.dickinson@utwente.nl http://dickinson.website/teaching/2017co.html version: 28/11/17 Monday
More informationMinimum volume semialgebraic sets for robust estimation
Minimum volume semialgebraic sets for robust estimation Fabrizio Dabbene 1, Didier Henrion 2,3,4 October 31, 2018 arxiv:1210.3183v1 [math.oc] 11 Oct 2012 Abstract Motivated by problems of uncertainty propagation
More informationComplexity of 10 Decision Problems in Continuous Time Dynamical Systems. Amir Ali Ahmadi IBM Watson Research Center
Complexity of 10 Decision Problems in Continuous Time Dynamical Systems Amir Ali Ahmadi IBM Watson Research Center Anirudha Majumdar MIT Russ Tedrake MIT 1 Given a polynomial vector field: Decide if the
More informationSemidefinite approximations of projections and polynomial images of semialgebraic sets
Semidefinite approximations of projections and polynomial images of semialgebraic sets Victor Magron 1 Didier Henrion 2,3,4 Jean-Bernard Lasserre 2,3 October 17, 2014 Abstract Given a compact semialgebraic
More informationOptimization on linear matrix inequalities for polynomial systems control
arxiv:1309.3112v1 [math.oc] 12 Sep 2013 Optimization on linear matrix inequalities for polynomial systems control Didier Henrion 1,2 Draft lecture notes of September 13, 2013 1 LAAS-CNRS, Univ. Toulouse,
More informationMean squared error minimization for inverse moment problems
Mean squared error minimization for inverse moment problems Didier Henrion 1,2,3, Jean B. Lasserre 1,2,4, Martin Mevissen 5 August 28, 2012 Abstract We consider the problem of approximating the unknown
More informationLinear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory
Linear Matrix Inequalities, Semidefinite Programming and Quantum Information Theory Toulouse, 18-22 January 2015 1. Antonio Acín (ICFO-The Institute of Photonic Sciences, Barcelona) Non-commutative polynomial
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationGlobal Optimization of Polynomials
Semidefinite Programming Lecture 9 OR 637 Spring 2008 April 9, 2008 Scribe: Dennis Leventhal Global Optimization of Polynomials Recall we were considering the problem min z R n p(z) where p(z) is a degree
More informationDistributionally Robust Convex Optimization
Submitted to Operations Research manuscript OPRE-2013-02-060 Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However,
More informationECE7850 Lecture 8. Nonlinear Model Predictive Control: Theoretical Aspects
ECE7850 Lecture 8 Nonlinear Model Predictive Control: Theoretical Aspects Model Predictive control (MPC) is a powerful control design method for constrained dynamical systems. The basic principles and
More information- Well-characterized problems, min-max relations, approximate certificates. - LP problems in the standard form, primal and dual linear programs
LP-Duality ( Approximation Algorithms by V. Vazirani, Chapter 12) - Well-characterized problems, min-max relations, approximate certificates - LP problems in the standard form, primal and dual linear programs
More informationarxiv: v2 [math.oc] 31 May 2010
A joint+marginal algorithm for polynomial optimization Jean B. Lasserre and Tung Phan Thanh arxiv:1003.4915v2 [math.oc] 31 May 2010 Abstract We present a new algorithm for solving a polynomial 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 informationAnalysis and Control of Nonlinear Actuator Dynamics Based on the Sum of Squares Programming Method
Analysis and Control of Nonlinear Actuator Dynamics Based on the Sum of Squares Programming Method Balázs Németh and Péter Gáspár Abstract The paper analyses the reachability characteristics of the brake
More informationON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL. R.T. Rockafellar*
ON THE ESSENTIAL BOUNDEDNESS OF SOLUTIONS TO PROBLEMS IN PIECEWISE LINEAR-QUADRATIC OPTIMAL CONTROL R.T. Rockafellar* Dedicated to J-L. Lions on his 60 th birthday Abstract. Primal and dual problems of
More informationRecent robust analysis and design results. for simple adaptive control
Recent robust analysis and design results for simple adaptive control Dimitri PEAUCELLE LAAS-CNRS - Université de Toulouse - FRANCE Cooperation program between CNRS, RAS and RFBR A. Fradkov, B. Andrievsky,
More informationOptimal switching control design for polynomial systems: an LMI approach
Optimal switching control design for polynomial systems: an LMI approach Didier Henrion 1,2,3, Jamal Daafouz 4, Mathieu Claeys 1 arxiv:133.1988v1 [math.oc] 8 Mar 213 Draft of June 22, 218 Abstract We propose
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 Methods in Optimal and Robust Control
LMI Methods in Optimal and Robust Control Matthew M. Peet Arizona State University Lecture 15: Nonlinear Systems and Lyapunov Functions Overview Our next goal is to extend LMI s and optimization to nonlinear
More informationProbabilistic and Set-based Model Invalidation and Estimation Using LMIs
Preprints of the 19th World Congress The International Federation of Automatic Control Probabilistic and Set-based Model Invalidation and Estimation Using LMIs Stefan Streif Didier Henrion Rolf Findeisen
More informationConvexification of Mixed-Integer Quadratically Constrained Quadratic Programs
Convexification of Mixed-Integer Quadratically Constrained Quadratic Programs Laura Galli 1 Adam N. Letchford 2 Lancaster, April 2011 1 DEIS, University of Bologna, Italy 2 Department of Management Science,
More informationFinding largest small polygons with GloptiPoly
Finding largest small polygons with GloptiPoly Didier Henrion, Frederic Messine To cite this version: Didier Henrion, Frederic Messine. Finding largest small polygons with GloptiPoly. Journal of Global
More informationConvex Optimization. (EE227A: UC Berkeley) Lecture 28. Suvrit Sra. (Algebra + Optimization) 02 May, 2013
Convex Optimization (EE227A: UC Berkeley) Lecture 28 (Algebra + Optimization) 02 May, 2013 Suvrit Sra Admin Poster presentation on 10th May mandatory HW, Midterm, Quiz to be reweighted Project final report
More informationResearch overview. Seminar September 4, Lehigh University Department of Industrial & Systems Engineering. Research overview.
Research overview Lehigh University Department of Industrial & Systems Engineering COR@L Seminar September 4, 2008 1 Duality without regularity condition Duality in non-exact arithmetic 2 interior point
More informationHilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry
Hilbert s 17th Problem to Semidefinite Programming & Convex Algebraic Geometry Rekha R. Thomas University of Washington, Seattle References Monique Laurent, Sums of squares, moment matrices and optimization
More informationApproximating Pareto Curves using Semidefinite Relaxations
Approximating Pareto Curves using Semidefinite Relaxations Victor Magron, Didier Henrion,,3 Jean-Bernard Lasserre, arxiv:44.477v [math.oc] 6 Jun 4 June 7, 4 Abstract We consider the problem of constructing
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 informationDetecting global optimality and extracting solutions in GloptiPoly
Detecting global optimality and extracting solutions in GloptiPoly Didier Henrion 1, Jean-Bernard Lasserre 1 September 5, 5 Abstract GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear
More informationRealization theory for systems biology
Realization theory for systems biology Mihály Petreczky CNRS Ecole Central Lille, France February 3, 2016 Outline Control theory and its role in biology. Realization problem: an abstract formulation. Realization
More informationIntroduction to Semidefinite Programming I: Basic properties a
Introduction to Semidefinite Programming I: Basic properties and variations on the Goemans-Williamson approximation algorithm for max-cut MFO seminar on Semidefinite Programming May 30, 2010 Semidefinite
More informationThe Big Picture. Python environment? Discuss Examples of unpredictability. Chaos, Scientific American (1986)
The Big Picture Python environment? Discuss Examples of unpredictability Email homework to me: chaos@cse.ucdavis.edu Chaos, Scientific American (1986) Odds, Stanislaw Lem, The New Yorker (1974) 1 Nonlinear
More informationOptimization 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 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 informationLinear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013
Linear Quadratic Zero-Sum Two-Person Differential Games Pierre Bernhard June 15, 2013 Abstract As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension,
More informationCONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION
CONVEXITY IN SEMI-ALGEBRAIC GEOMETRY AND POLYNOMIAL OPTIMIZATION JEAN B. LASSERRE Abstract. We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic
More informationLecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.
Lecture 4 Chapter 4: Lyapunov Stability Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 4 p. 1/86 Autonomous Systems Consider the autonomous system ẋ
More informationSUM-OF-SQUARES BASED STABILITY ANALYSIS FOR SKID-TO-TURN MISSILES WITH THREE-LOOP AUTOPILOT
SUM-OF-SQUARES BASED STABILITY ANALYSIS FOR SKID-TO-TURN MISSILES WITH THREE-LOOP AUTOPILOT Hyuck-Hoon Kwon*, Min-Won Seo*, Dae-Sung Jang*, and Han-Lim Choi *Department of Aerospace Engineering, KAIST,
More informationTime Delay Margin Analysis for an Adaptive Controller
Time Delay Margin Analysis for an Adaptive Controller Andrei Dorobantu, Peter Seiler, and Gary J. Balas Department of Aerospace Engineering & Mechanics University of Minnesota, Minneapolis, MN, 55455,
More information