Sum of Squares and SemiDefinite Programmming Relaxations of Polynomial Optimization Problems The 2006 IEICE Society Conference Kanazawa, September 21,

Slides:

Advertisements

Similar presentations

1 A Convex Polynomial that is not SOS-Convex Amir Ali Ahmadi Pablo A. Parrilo Laboratory for Information and Decision Systems Massachusetts Institute of.

Advertisements

Factoring the Sum or the Difference of Two Cubes. Subtitle: Know the CARD!!!

Convex Programming Brookes Vision Reading Group. Huh? What is convex ??? What is programming ??? What is convex programming ???

C&O 355 Mathematical Programming Fall 2010 Lecture 9

The CORS method Selecting the roots of a system of polynomial equations with combinatorial optimization H. Bekker E.P. Braad B. Goldengorin University.

Globally Optimal Estimates for Geometric Reconstruction Problems Tom Gilat, Adi Lakritz Advanced Topics in Computer Vision Seminar Faculty of Mathematics.

ESE601: Hybrid Systems Some tools for verification Spring 2006.

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

Manifold Sparse Beamforming

Venkataramanan Balakrishnan Purdue University Applications of Convex Optimization in Systems and Control.

Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.

Approximation Algoirthms: Semidefinite Programming Lecture 19: Mar 22.

SDPA: Leading-edge Software for SDP Informs ’ 08 Tokyo Institute of Technology Makoto Yamashita Mituhiro Fukuda Masakazu Kojima Kazuhide Nakata.

HYBRID SIMULATED ANNEALING AND DIRECT SEARCH METHOD FOR NONLINEAR UNCONSTRAINED GLOBAL OPTIMIZATION Abdel-Rahman Hedar and Masao Fukushima Speaker : UFO.

Semidefinite Programming

Direct Convex Relaxations of Sparse SVM Antoni B. Chan, Nuno Vasconcelos, and Gert R. G. Lanckriet The 24th International Conference on Machine Learning.

Pablo A. Parrilo ETH Zürich SOS Relaxations for System Analysis: Possibilities and Perspectives Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.

1 On the Optimization of the Tay-Kingsbury 2-D Filterbank Bogdan Dumitrescu Tampere Int. Center for Signal Processing Tampere University of Technology,

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 6 Nonlinear Unconstrained Optimization.

5.3 Complex Numbers; Quadratic Equations with a Negative Discriminant.

Pablo A. Parrilo ETH Zürich Semialgebraic Relaxations and Semidefinite Programs Pablo A. Parrilo ETH Zürich control.ee.ethz.ch/~parrilo.

A Projection Framework for Near- Potential Polynomial Games Nikolai Matni Control and Dynamical Systems, California.

How are we computing? Invalidation Certificates Consider invalidating the constraints (prior info, and N dataset units) The invalidation certificate is.

High Performance Solvers for Semidefinite Programs

8.5 – Factoring Differences of Squares. Recall: Recall: Product of a Sum & a Difference.

1 High-Performance Implementation of Positive Matrix Completion for SDPs Makoto Yamashita (Tokyo Institute of Technology) Kazuhide Nakata (Tokyo Institute.

Sparsity in Polynomial Optimization IMA Annual Program Year Workshop "Optimization and Control" Minneapolis, January 16-20, 2007 Masakazu Kojima Tokyo.

Exploiting the complementarity structure: stability analysis of contact dynamics via sums-of-squares Michael Posa Joint work with Mark Tobenkin and Russ.

Square Root The square root of a nonnegative number is a number that, when multiplied by itself, is equal to that nonnegative number. Square roots have.

Factoring Special Products

Autonomic scheduling of tasks from data parallel patterns to CPU/GPU core mixes Published in: High Performance Computing and Simulation (HPCS), 2013 International.

EXAMPLE 3 Factor by grouping Factor the polynomial x 3 – 3x 2 – 16x + 48 completely. x 3 – 3x 2 – 16x + 48 Factor by grouping. = (x 2 – 16)(x – 3) Distributive.

EXAMPLE 3 Multiply polynomials vertically and horizontally a. Multiply – 2y 2 + 3y – 6 and y – 2 in a vertical format. b. Multiply x + 3 and 3x 2 – 2x.

1 Efficient Parallel Software for Large-Scale Semidefinite Programs Makoto Tokyo-Tech Katsuki Chuo University MSC Yokohama.

INFOMRS Charlotte1 Parallel Computation for SDPs Focusing on the Sparsity of Schur Complements Matrices Makoto Tokyo Tech Katsuki Fujisawa.

2.3Special Products of Polynomials Square of a Binomial Pattern Multiply binomials by using F O I L.

Introduction to Semidefinite Programs Masakazu Kojima Semidefinite Programming and Its Applications Institute for Mathematical Sciences National University.

Multi-area Nonlinear State Estimation using Distributed Semidefinite Programming Hao Zhu October 15, 2012 Acknowledgements: Prof. G.

1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.

Georgina Hall Princeton, ORFE Joint work with Amir Ali Ahmadi

Section 6.4 Solving Polynomial Equations Obj: to solve polynomial equations.

6.4 Solving Polynomial Equations. One of the topics in this section is finding the cube or cube root of a number. A cubed number is the solution when.

EXAMPLE 1 Find a common monomial factor Factor the polynomial completely. a. x 3 + 2x 2 – 15x Factor common monomial. = x(x + 5)(x – 3 ) Factor trinomial.

1 Ellipsoid-type Confidential Bounds on Semi-algebraic Sets via SDP Relaxation Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.

1 Parallel Software for SemiDefinite Programming with Sparse Schur Complement Matrix Makoto Tokyo-Tech Katsuki Chuo University Mituhiro.

Do Now: Solve x2 – 20x + 51 = 0 3x2 – 5x – 2 = 0 Today’s Agenda

Bellwork 1.(x + 3)(x − 3) 2.(3x + 1)(2x − 1). SPECIAL PRODUCTS OF POLYNOMIALS Section 7.3.

Nonlinear Dimension Reduction: Semi-Definite Embedding vs. Local Linear Embedding Li Zhang and Lin Liao.

Iterative LP and SOCP-based approximations to semidefinite and sum of squares programs Georgina Hall Princeton University Joint work with: Amir Ali Ahmadi.

Approximation Schemes for Constrained Scheduling Problems Author ： Leslie A. HalP 0. R. Center, M.I.T. David B. Shmoyst Dept. of Mathematics, M.I.T. 報告者：童耀民.

Polynomial Norms Amir Ali Ahmadi (Princeton University) Georgina Hall

Nonnegative polynomials and applications to learning

Polynomial DC decompositions

SOS is not obviously automatizable,

Ellipse Fitting COMP 4900C Winter 2008.

Essential Questions How do we use the Factor Theorem to determine factors of a polynomial? How do we factor the sum and difference of two cubes.

Absolute Value inequalities

Warm Up - September 27, 2017 Classify each polynomial by degree and by number of terms. 1. 5x x2 + 4x - 2 Write each polynomial in standard form.

Mathematical Programming (towards programming with math)

Factor and Solve Polynomial Equations

Factor & Solve Polynomial Equations

Robust Optimization and Applications in Machine Learning

Quadratic Equations.

5.5: Factoring the Sum and Difference of Two Cubes

Rank-Sparsity Incoherence for Matrix Decomposition

A particular discrete dynamical program used as a model for one specific situation in chess involving knights and rooks 22nd EUROPEAN CONFERENCE ON OPERATIONS.

Variational Inequalities

CS5321 Numerical Optimization

Presentation transcript:

Sum of Squares and SemiDefinite Programmming Relaxations of Polynomial Optimization Problems The 2006 IEICE Society Conference Kanazawa, September 21, 2006 Masakazu Kojima Tokyo Institute of Technology An introduction to the recent development of SOS and SDP relaxations for computing global optimal solutions of POPs Exploiting sparsity in SOS and SDP relaxations to solve large scale POPs This presentation PowerPoint file is available at

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Conversion of SOS relaxation into an SDP --- 1

Conversion of SOS relaxation into an SDP --- 2

Conversion of SOS relaxation into an SDP --- 3

Conversion of SOS relaxation into an SDP --- 4

Conversion of SOS relaxation into an SDP --- 5

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks

Outline 1. POPs (Polynomial Optimization Problems) 2. Nonnegative polynomials and SOS (Sum of Squares) polynomials 3. SOS relaxation of unconstrained POPs 4. Conversion of SOS relaxation into an SDP (Semidefinite Program) 5. Exploiting structured sparsity 6. SOS relaxation of constrained POPs --- very briefly 7. Numerical results 8. Polynomial SDPs 9. Concluding remarks