Name
Title | ||
|---|---|---|
Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems |
Abstract | ||
|---|---|---|
Based on the convergent sequence of SDP relaxations for a multivariate polynomial optimization problem (POP) by Lasserre (2006), Waki et al. (2006) constructed a sequence of sparse SDP relaxations to solve sparse POPs efficiently. Nevertheless, the size of the sparse SDP relaxation is the major obstacle in order to solve POPs of higher degree. This paper proposes an approach to transform general POPs to quadratic optimization problems (QOPs), which allows to reduce the size of the SDP relaxation substantially. We introduce different heuristics resulting in equivalent QOPs and show how sparsity of a POP is maintained under the transformation procedure. As the most important issue, we discuss how to increase the quality of the SDP relaxation for a QOP. Moreover, we increase the accuracy of the solution of the SDP relaxation by applying additional local optimization techniques. Finally, we demonstrate the high potential of this approach through numerical results for large scale POPs of higher degree. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S0217595910002533 | ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH |
Keywords | Field | DocType |
Polynomial optimization,quadratic optimization,semidefinite programming relaxation,sparsity | Polynomial optimization,Mathematical optimization,Limit of a sequence,Heuristics,Quadratic programming,Local search (optimization),Multivariate polynomials,Semidefinite programming relaxation,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
27 | 1 | 0217-5959 |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Mevissen | 1 | 45 | 4.96 |
| Masakazu Kojima | 2 | 1603 | 222.51 |