Automatic Control Laboratory, ETH Zürich www.control.ethz.ch Automatic dualization Johan Löfberg.

Slides:



Advertisements
Similar presentations
Support Vector Machine
Advertisements

Solving LP Models Improving Search Special Form of Improving Search
What is GAMS?. While they are not NLP solvers, per se, attention should be given to modeling languages like: GAMS- AIMMS-
C&O 355 Mathematical Programming Fall 2010 Lecture 22 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
Globally Optimal Estimates for Geometric Reconstruction Problems Tom Gilat, Adi Lakritz Advanced Topics in Computer Vision Seminar Faculty of Mathematics.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Lecture 8 Tuesday, 11/19/02 Linear Programming.
Chapter 6 Linear Programming: The Simplex Method
OR Simplex method (algebraic interpretation) Add slack variables( 여유변수 ) to each constraint to convert them to equations. (We may refer it as.
Schedule On Thursdays we will be here in SOS180 for: – (today) – – Homework 1 is on the web, due to next Friday (17: ).
ESE601: Hybrid Systems Some tools for verification Spring 2006.
Sum of Squares and SemiDefinite Programmming Relaxations of Polynomial Optimization Problems The 2006 IEICE Society Conference Kanazawa, September 21,
by Rianto Adhy Sasongko Supervisor: Dr.J.C.Allwright
Continuous optimization Problems and successes
Basis Expansion and Regularization Presenter: Hongliang Fei Brian Quanz Brian Quanz Date: July 03, 2008.
November 21, 2005 Center for Hybrid and Embedded Software Systems Homepage
Linear Programming and CPLEX Ting-Yuan Wang Advisor: Charlie C. Chen Department of Electrical and Computer Engineering University of Wisconsin-Madison.
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
Dual Problem of Linear Program subject to Primal LP Dual LP subject to ※ All duality theorems hold and work perfectly!
Support Vector Classification (Linearly Separable Case, Primal) The hyperplanethat solves the minimization problem: realizes the maximal margin hyperplane.
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and related Methods Numerical.
Classification Problem 2-Category Linearly Separable Case A- A+ Malignant Benign.
Computational Methods for Management and Economics Carla Gomes
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
Seminar in Advanced Machine Learning Rong Jin. Course Description  Introduction to the state-of-the-art techniques in machine learning  Focus of this.
ISM 206 Lecture 4 Duality and Sensitivity Analysis.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.
An Introduction to Support Vector Machines Martin Law.
ORDINARY DIFFERENTIAL EQUATION (ODE) LAPLACE TRANSFORM.
Optimization for Operation of Power Systems with Performance Guarantee
SeDuMi Interface A tool for solving LMI problems with SeDuMi
Extensions to the OSiL schema: Matrix and cone programming Horand I. Gassmann, Dalhousie University Jun Ma, Kipp Martin, Imre Polik.
Simplex method (algebraic interpretation)
General Nonlinear Programming (NLP) Software
Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.1 Chapter 12 Planning with linear programming.
Hossein Sahebdel Iran University Of Science And Technology May 12
MILP algorithms: branch-and-bound and branch-and-cut
CS Statistical Machine learning Lecture 18 Yuan (Alan) Qi Purdue CS Oct
An Introduction to Support Vector Machines (M. Law)
Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234: Lecture 4  Linear Programming  LP and Simplex Algorithm [PS82]-Ch2.
Machine Learning Weak 4 Lecture 2. Hand in Data It is online Only around 6000 images!!! Deadline is one week. Next Thursday lecture will be only one hour.
Stability Region Analysis using composite Lyapunov functions and bilinear SOS programming Support from AFOSR FA , April 05-November 06 Authors.
Robert Fourer, Jun Ma, Kipp Martin, Optimization Services, May 06, 2005 Optimization Services (OS) Jun Ma Industrial Engineering and Management Sciences.
1 Efficient Parallel Software for Large-Scale Semidefinite Programs Makoto Tokyo-Tech Katsuki Chuo University MSC Yokohama.
Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University.
Robust Optimization and Applications Laurent El Ghaoui IMA Tutorial, March 11, 2003.
Part 4 Nonlinear Programming 4.1 Introduction. Standard Form.
D Nagesh Kumar, IIScOptimization Methods: M7L2 1 Integer Programming Mixed Integer Linear Programming.
OR Simplex method (algebraic interpretation) Add slack variables( 여유변수 ) to each constraint to convert them to equations. (We may refer it as.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
Integer Programming Key characteristic of an Integer Program (IP) or Mixed Integer Linear Program (MILP): One or more of the decision variable must be.
GAMS: General Algebraic Modeling System Linear and Nonlinear Programming The full system documentation is provided electronically with the software.
LINEAR AND INTEGER PROGRAMMING The Simplex Method: A tutorial in three acts.
OR  Now, we look for other basic feasible solutions which gives better objective values than the current solution. Such solutions can be examined.
Support Vector Machine: An Introduction. (C) by Yu Hen Hu 2 Linear Hyper-plane Classifier For x in the side of o : w T x + b  0; d = +1; For.
Parametric Quadratic Optimization Oleksandr Romanko Joint work with Alireza Ghaffari Hadigheh and Tamás Terlaky McMaster University January 19, 2004.
Massive Support Vector Regression (via Row and Column Chunking) David R. Musicant and O.L. Mangasarian NIPS 99 Workshop on Learning With Support Vectors.
Nonlinear Dimension Reduction: Semi-Definite Embedding vs. Local Linear Embedding Li Zhang and Lin Liao.
Approximation Algorithms based on linear programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Introduction to Linear Programming Linear Programming Problem Linear Programming Problem Problem Formulation Problem Formulation A Simple Maximization.
The minimum cost flow problem
Glenn Fung, Murat Dundar, Bharat Rao and Jinbo Bi
Nonnegative polynomials and applications to learning
Local Gain Analysis of Nonlinear Systems
Chapter 5. Sensitivity Analysis
A Mathematical Programming Language
Matteo Fischetti, University of Padova
Nonlinear Dimension Reduction:
Simplex method (algebraic interpretation)
Presentation transcript:

Automatic Control Laboratory, ETH Zürich Automatic dualization Johan Löfberg

Outline YALMIP? Recent developments Automatic dualization –Primal-dual conic problems –What is the problem? –Implementation Applications of automatic dualization Conclusions

What is YALMIP? Free MATLAB toolbox for rapid definition, manipulation and solution of optimization problems. Originally aimed towards linear semidefinite programming. Supports linear, quadratic, second-order cone, semidefinite, bilinear, geometric, parametric and mixed integer programming. Interfaces most state-of-the-art solvers.

Supported solvers

Recent developments 1. Strengthened modelling framework for non-convex problems Automatic derivation of LPAutomatic derivation of MILP 2. Improved integration with MPT for multi-parametric optimization 3. Performance improvements in automatic dualization

Automatic dualization

Primal-dual conic pairs Everything revolves around the primal-dual conic pair We work with mixed linear, quadratic and semidefinite cones

Primal-dual conic pairs Much more convenient in practice to allow free variables (equality constraints) But this is where the problems arise...

Primal or dual? Example: Silly LP Dimension of the problem? Primal: Dual:

Primal or dual? Example: MAXCUT Dimension of the problem? Primal: Dual: Ouch! variables YALMIP always interprets in dual form 

Problem: Data ( C, A, b, F, f ) not unique (including dimensions) Primal or dual? Problem: YALMIP always interprets in dual form Wanted: Solution: Automatic conversion from default dual form interpretation to a symbolic primal form interpretation Detect and extract primal form numerical model and return symbolic dual of this model.

Implementation

Where are we? External solver (SeDuMi, SDPA, CPLEX...) Solver interface YALMIP to solver format conversion YALMIP core Parsing, classification, conversion, solution treatment etc Symbolic modeling level User experience in MATLAB Solver specific format Internal numerical format Symbolic model Internal solvers (MIP, BMIBNB, CUTSDP, MPMIQP) Features SOS, Moment,Block-diagonalization, Dualization,...

Input: Symbolic YALMIP model (with constraints ) Implementation Output: Symbolic YALMIP model Notation: Primal cone: Variable X & a constraint of the type Translated primal cone: Constraint of the type Dual cone: Anything else (except equality constraints)

Implementation First step: Find simple primal cones Initialize: Detected cones and offsets X ={}, H = {}

Implementation Second step : Find translated primal cones

Implementation Third step: Introduce slacks for dual cones Status: All primal cone variables are detected, remaining variables are free and remaining constraints are equality constraints.

Implementation Fourth step: Extract numerical data from remaining constraints Intermediate result: Uniquely defined model Return: Symbolic dual form model of detected primal problem Original variables are duals to constraints in the resulting symbolic model. YALMIP automatically tracks this information and updates numerical data accordingly when the new model is solved.

Applications

MAXCUT (Computations using SDPT3 3.1)

Sum-of-squares Find s such that a polynomial p ( x, s ) is non-negative in x Can be addressed using sum-of-squares which leads to YALMIP formulates all SOS problems in this primal form, but solving them like this would be inefficient (since it interprets the model in dual form) Hence, dualization needed Stupid! Why not derive the dual form directly?

Sum-of-squares Generality! 1. Additional constraints on s does not complicate dualization or derive an image model (QR or sparse basis, one line of code) For non-convex (non-linear/integer/rank constrained) SOS problems, we can solve the problem as stated...

Sum-of-squares

Stability analysis Piecewise affine system (simplified) SDP for piecewise quadratic Lyapunov certificate Dualize if some H is very tall compared to state dimension

Outlook & conclusion Automatic decision to dualize? Dualize quadratic objective functions? Partial dualization? Performance for large-scale problems... Very simple but very useful Commands:

Download