Robust Semidefinite Programming and Its Application to Sampled-Data Control Yasuaki Oishi (Nanzan University) Udine, Italy August 26, 2011 Workshop on.

Slides:



Advertisements
Similar presentations
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Advertisements

Globally Optimal Estimates for Geometric Reconstruction Problems Tom Gilat, Adi Lakritz Advanced Topics in Computer Vision Seminar Faculty of Mathematics.
Optimization. f(x) = 0 g i (x) = 0 h i (x)
1 Welcome to the Kernel-Class My name: Max (Welling) Book: There will be class-notes/slides. Homework: reading material, some exercises, some MATLAB implementations.
PARAMETER DEPENDENT LYAPUNOV FUNCTIONS FOR STABILITY OF LINEAR PARAMETER VARYING SYSTEMS Nedia Aouani, Salah Salhi, Germain Garcia, Mekki Ksouri Research.
Zonotopes Techniques for Reachability Analysis Antoine Girard Workshop “Topics in Computation and Control” March 27 th 2006, Santa Barbara, CA, USA
Page 1 Page 1 ENGINEERING OPTIMIZATION Methods and Applications A. Ravindran, K. M. Ragsdell, G. V. Reklaitis Book Review.
Convex Optimization Chapter 1 Introduction. What, Why and How  What is convex optimization  Why study convex optimization  How to study convex optimization.
Convex Position Estimation in Wireless Sensor Networks
Optimization Problems 虞台文 大同大學資工所 智慧型多媒體研究室. Content Introduction Definitions Local and Global Optima Convex Sets and Functions Convex Programming Problems.
1 Nonlinear Control Design for LDIs via Convex Hull Quadratic Lyapunov Functions Tingshu Hu University of Massachusetts, Lowell.
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Javad Lavaei Department of Electrical Engineering Columbia University Various Techniques for Nonlinear Energy-Related Optimizations.
Javad Lavaei Department of Electrical Engineering Columbia University Graph-Theoretic Algorithm for Nonlinear Power Optimization Problems.
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
LMI Methods for Oceanic Control Systems Jean-Pierre Folcher Laboratoire Signaux et Systèmes de Sophia Antipolis, CNRS/UNSA Worshop SUMARE, Sophia Antipolis,
Robust Multi-Kernel Classification of Uncertain and Imbalanced Data
IQC analysis of linear constrained MPC W.P. Heath*, G. Li*, A.G. Wills†, B. Lennox* *University of Manchester †University of Newcastle, Australia.
Direct Convex Relaxations of Sparse SVM Antoni B. Chan, Nuno Vasconcelos, and Gert R. G. Lanckriet The 24th International Conference on Machine Learning.
Explicit Non-linear Optimal Control Law for Continuous Time Systems via Parametric Programming Vassilis Sakizlis, Vivek Dua, Stratos Pistikopoulos Centre.
1 A Lyapunov Approach to Frequency Analysis Tingshu Hu, Andy Teel UC Santa Barbara Zongli Lin University of Virginia.
1 Absolute Stability with a Generalized Sector Condition Tingshu Hu.
Seminar in Advanced Machine Learning Rong Jin. Course Description  Introduction to the state-of-the-art techniques in machine learning  Focus of this.
Combining Multipath Routing and Congestion Control for Robustness Peter Key.
Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.
Low-Rank Solution of Convex Relaxation for Optimal Power Flow Problem
Javad Lavaei Department of Electrical Engineering Columbia University Joint work with Somayeh Sojoudi Convexification of Optimal Power Flow Problem by.
Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.
Integrality Gaps for Sparsest Cut and Minimum Linear Arrangement Problems Nikhil R. Devanur Subhash A. Khot Rishi Saket Nisheeth K. Vishnoi.
Robust Monotonic Optimization Framework for Multicell MISO Systems Emil Björnson 1, Gan Zheng 2, Mats Bengtsson 1, Björn Ottersten 1,2 1 Signal Processing.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
1 Jorge Nocedal Northwestern University With S. Hansen, R. Byrd and Y. Singer IPAM, UCLA, Feb 2014 A Stochastic Quasi-Newton Method for Large-Scale Learning.
Inequity aversion in screening contracts: experimental evidence and model analysis IFORS, 15 th July 2014, Guido Voigt.
Sparsity in Polynomial Optimization IMA Annual Program Year Workshop "Optimization and Control" Minneapolis, January 16-20, 2007 Masakazu Kojima Tokyo.
Real Zeros of Polynomial Functions. Quick Review.
Journey to New Areas of Optimization Trends in Modern Optimization Feb., 2007 Kyungchul Park.
1 Adaptive Control Neural Networks 13(2000): Neural net based MRAC for a class of nonlinear plants M.S. Ahmed.
Kernels Usman Roshan CS 675 Machine Learning. Feature space representation Consider two classes shown below Data cannot be separated by a hyperplane.
Stability Region Analysis using composite Lyapunov functions and bilinear SOS programming Support from AFOSR FA , April 05-November 06 Authors.
Javad Lavaei Department of Electrical Engineering Columbia University Convex Relaxation for Polynomial Optimization: Application to Power Systems and Decentralized.
Overview of Optimization in Ag Economics Lecture 2.
Survey of Kernel Methods by Jinsan Yang. (c) 2003 SNU Biointelligence Lab. Introduction Support Vector Machines Formulation of SVM Optimization Theorem.
Robust Optimization and Applications Laurent El Ghaoui IMA Tutorial, March 11, 2003.
11.4 Nonlinear Inequalities in One Variable Math, Statistics & Physics 1 First we find the zeroes of the polynomial; that’s the solutions of the equation:
Section 5.5 The Real Zeros of a Polynomial Function.
2.4/2.52.4/2.5 Real Zeros of Polynomial Functions.
BART VANLUYTEN, JAN C. WILLEMS, BART DE MOOR 44 th IEEE Conference on Decision and Control December 2005 Model Reduction of Systems with Symmetries.
Inexact SQP methods for equality constrained optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Automated Controller Synthesis in QFT Designs … IIT Bombay P.S.V. Nataraj and Sachin Tharewal 1 An Interval Analysis Algorithm for Automated Controller.
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Global Optimization Methods for the Discrete Network Design Problem Dr. Shuaian Wang Lecturer University of Wollongong Dr. Qiang Meng Associate Professor.
Linear & Nonlinear Programming -- Basic Properties of Solutions and Algorithms.
Boaz Barak (MSR New England) Fernando G.S.L. Brandão (Universidade Federal de Minas Gerais) Aram W. Harrow (University of Washington) Jonathan Kelner (MIT)
Linear Programming Chapter 1 Introduction.
Parametric Quadratic Optimization Oleksandr Romanko Joint work with Alireza Ghaffari Hadigheh and Tamás Terlaky McMaster University January 19, 2004.
Forward and Backward Deviation Measures and Robust Optimization Peng Sun (Duke) with Xin Chen (UIUC) and Melvyn Sim (NUS)
Polynomial & Rational Inequalities
Polynomial Norms Amir Ali Ahmadi (Princeton University) Georgina Hall
Georgina Hall Princeton, ORFE Joint work with Amir Ali Ahmadi
Nonnegative polynomials and applications to learning
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization Presenter: Xia Li.
Polynomial DC decompositions
Alemseged G. Weldeyesus, PhD student Mathias Stolpe, Senior Researcher
Local Gain Analysis of Nonlinear Systems
Nuclear Norm Heuristic for Rank Minimization
Polynomial and Rational Inequalities
  CW: Pg (27, 31, 33, 43, 47, 48, 69, 73, 77, 79, 83, 85, 87, 89)
A particular discrete dynamical program used as a model for one specific situation in chess involving knights and rooks 22nd EUROPEAN CONFERENCE ON OPERATIONS.
Warm-up: State the domain.
Presentation transcript:

Robust Semidefinite Programming and Its Application to Sampled-Data Control Yasuaki Oishi (Nanzan University) Udine, Italy August 26, 2011 Workshop on Uncertain Dynamical Systems * Joint work with Teodoro Alamo

1. Introduction 2 Robust semidefinite programming problems Optimization problems constrained by uncertain linear matrix inequalities Many applications in robust control Robust SDP problem Affine parameter dependence Polynomial or rational par. dep.

3 This talk: general nonlinear parameter dependence How to obtain the sufficient condition? How to make the condition less conservative? Key idea: DC-representations “difference of two convex functions” [Tuan--Apkarian--Hosoe--Tuy 00] [Bravo--Alamo--Fiacchini--Camacho 07]

2. Preparations 4 nonlinear fn. Problem Assumption

DC-representation 5 convex Example

6 cf. [Adjiman--Floudas 96] Mild enough to assume

3. Proposed approach 7 Assumption: DC-representation is available convex Key step: obtaining bounds concaveconvex

Obtaining bounds 8 :concave :convex

9 concaveconvex

10 Approximate problem Number of LMIs Approximate solution cf. NP-hardness Conservative

Reduction of conservatism 11 Adaptive division

12 Quality of the approximation depends on the choice Measure of conservatism

13 Measure of conservatism Theorem

Example 14

Example 15

4. Application to sampled-data control 16 Analysis and design of such sampled-data systems hold sampler discrete [Fridman et al. 04][Hetel et al. 06][Mirkin 07][Naghshtabrizi et al. 08] [Suh 08][Fujioka 09][Skaf--Boyd 09][O.--Fujioka 10][Seuret 11]...

17 [O.--Fujioka 10] hold sampler discrete  Formulation into a robust SDP  Avoiding a numerical problem for a small sampling [O.--Fujioka 10] interval

6. Summary 18 Robust SDP problems with nonlinear param. dep. Conservative approach using DC-representations  Concave and convex bounds  Approximate problem  Reduction of conservatism Combination with the polynomial-based methods [Chesi--Hung 08][Peaucelle--Sato 09][O. 09] Optimization of the bounds w.r.t. some measure Application to sampled-data control