Name
Title | ||
|---|---|---|
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones |
Abstract | ||
|---|---|---|
This short note extends the sparse SOS (sum of squares) and SDP (semidefinite programming) relaxation proposed by Waki, Kim,
Kojima and Muramatsu for normal POPs (polynomial optimization problems) to POPs over symmetric cones, and establishes its
theoretical convergence based on the recent convergence result by Lasserre on the sparse SOS and SDP relaxation for normal
POPs. A numerical example is also given to exhibit its high potential. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s10589-007-9112-2 | Computational Optimization and Applications |
Keywords | Field | DocType |
Polynomial optimization problem,Conic program,Symmetric cone,Euclidean Jordan algebra,Sum of squares,Global optimization,Semidefinite program | Convergence (routing),Polynomial optimization,Discrete mathematics,Mathematical optimization,Global optimization,Symmetric cone,Explained sum of squares,Conic optimization,Semidefinite programming,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 1 | 0926-6003 |
Citations | PageRank | References |
16 | 0.88 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Masakazu Kojima | 1 | 1603 | 222.51 |
| Masakazu Muramatsu | 2 | 336 | 28.68 |