Structured Sparsity in Polynomial Optimization: Sparse SDP Relaxation and PDE Applications, Slides of Mathematics

The formulation of structured sparsity in polynomial optimization, focusing on unconstrained and constrained cases with linear objective functions. The document also covers the use of sparse sdp relaxation for constrained polynomial optimization problems and its applications to partial differential equations. The authors address challenges in the accuracy and efficiency of the sparse sdp relaxation method.

Typology: Slides

2011/2012

Uploaded on 07/03/2012

toshi
toshi 🇮🇳

5

(5)

23 documents

1 / 32

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Sparsity in Polynomial Optimization
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20

Partial preview of the text

Download Structured Sparsity in Polynomial Optimization: Sparse SDP Relaxation and PDE Applications and more Slides Mathematics in PDF only on Docsity!

Sparsity in Polynomial Optimization

Contents

  1. How do we formulate structured sparsity? 1-1. Unconstrained cases. 1-2. Constrained and linear objective function cases. (Recent Joint work with S.Kim & K.Kobayashi)
  2. Sparse SDP relaxation of constrained POPs.
  3. Applications to PDEs (partial differential equations).
  4. Concluding remarks. POP --- Polynomial Optimization Problem

Contents

  1. How do we formulate structured sparsity? 1-1. Unconstrained cases. 1-2. Constrained and linear objective function cases.
  2. Sparse SDP relaxation of constrained POPs.
  3. Applications to PDEs (partial differential equations).
  4. Concluding remarks. POP --- Polynomial Optimization Problem

Contents

  1. How do we formulate structured sparsity? 1-1. Unconstrained cases. 1-2. Constrained and linear objective function cases.
  2. Sparse SDP relaxation of constrained POPs.
  3. Applications to PDEs (partial differential equations).
  4. Concluding remarks.
    • We consider cases where objective functions are linear.
    • LP, SOCP and SDP + Primal-Dual Interior-Point Method.

Example csp matrix R = (n=20)

Example

Contents

  1. How do we formulate structured sparsity? 1-1. Unconstrained cases. 1-2. Constrained and linear objective function cases.
  2. Sparse SDP relaxation of constrained POPs. (Joint work with S.Kim, M.Muramatsu & H.Waki)
  3. Applications to PDEs (partial differential equations).
  4. Concluding remarks. Sections 1-1 + 1-2 ==> Section 2 Sparse SDP relaxation = Modification of Lasserre’s relaxation

Contents

  1. How do we formulate structured sparsity? 1-1. Unconstrained cases. 1-2. Constrained and linear objective function cases.
  2. Sparse SDP relaxation of constrained POPs.
  3. Applications to PDEs (partial differential equations). (Ongoing joint work with M.Mevissen, J.Nie & N.Takayama)
  4. Concluding remarks.