Nonnegative polynomial optimization over unit spheres and convex programming relaxations
dc.contributor.author | Zhou, Guanglu | |
dc.contributor.author | Caccetta, Louis | |
dc.contributor.author | Teo, Kok Lay | |
dc.contributor.author | Wu, S. | |
dc.date.accessioned | 2017-01-30T15:28:18Z | |
dc.date.available | 2017-01-30T15:28:18Z | |
dc.date.created | 2013-03-06T20:00:39Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Zhou, Guanglu and Caccetta, Louis and Teo, Kok Lay and Wu, Soon-yi. 2012. Nonnegative polynomial optimization over unit spheres and convex programming relaxations. SIAM Journal on Optimization. 22 (3): pp. 987-1008. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/46637 | |
dc.identifier.doi | 10.1137/110827910 | |
dc.description.abstract |
We consider approximation algorithms for nonnegative polynomial optimization over unit spheres. Such optimization models have wide applications, e.g., in signal and image processing, high order statistics, and computer vision. Since polynomial functions are nonconvex, the problems under consideration are all NP-hard. In this paper, based on convex polynomial optimization relaxations, we propose polynomial-time approximation algorithms with new approximation bounds. Numerical results are reported to show the effectiveness of the proposed approximation algorithms. | |
dc.publisher | Society for Industrial and Applied Mathematics | |
dc.subject | nonnegative polynomial optimization | |
dc.subject | approximation - algorithm | |
dc.subject | convex optimization relaxation | |
dc.title | Nonnegative polynomial optimization over unit spheres and convex programming relaxations | |
dc.type | Journal Article | |
dcterms.source.volume | 22 | |
dcterms.source.startPage | 987 | |
dcterms.source.endPage | 1008 | |
dcterms.source.issn | 0363-0129 | |
dcterms.source.title | SIAM Journal on Optimization | |
curtin.note |
Copyright © 2012 Society for Industrial and Applied Mathematics | |
curtin.department | ||
curtin.accessStatus | Open access |