Nonnegative polynomial optimization over unit spheres and convex programming relaxations
MetadataShow full item record
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.
Copyright © 2012 Society for Industrial and Applied Mathematics
Showing items related by title, author, creator and subject.
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
Ruan, Ning (2012)Duality is one of the most successful ideas in modern science  . It is essential in natural phenomena, particularly, in physics and mathematics   . In this thesis, we consider the canonical duality ...
Li, Bin (2011)In this thesis, we consider several types of optimal control problems with constraints on the state and control variables. These problems have many engineering applications. Our aim is to develop efficient numerical methods ...