Name
Title | ||
|---|---|---|
Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization. |
Abstract | ||
|---|---|---|
We propose the moment cone relaxation for a class of polynomial optimization problems to extend the results on the completely positive cone programming relaxation for the quadratic optimization model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the polynomial optimization problems, so that efficient numerical methods can be developed in the future. We establish the equivalence between the optimal value of the polynomial optimization problem and that of the moment cone relaxation under conditions similar to the ones assumed in the quadratic optimization model. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10957-015-0794-9 | Journal of Optimization Theory and Applications |
Keywords | Field | DocType |
Moment cone relaxation, Polynomial optimization, Copositive programming, Completely positive programming, 90C20, 90C25, 90C26 | Second-order cone programming,Polynomial optimization,Mathematical optimization,Mathematical analysis,Equivalence (measure theory),Quadratic programming,Lagrangian relaxation,Numerical analysis,Conic optimization,Mathematics | Journal |
Volume | Issue | ISSN |
168 | 3 | 1573-2878 |
Citations | PageRank | References |
2 | 0.37 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Naohiko Arima | 1 | 22 | 3.01 |
| S. Kim | 2 | 248 | 14.25 |
| Masakazu Kojima | 3 | 1603 | 222.51 |