Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
© 2017 Higher Education Press and Springer-Verlag Berlin Heidelberg We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vi...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Gaodeng Jiaoyu Chubanshe
2017
|
| Online Access: | http://hdl.handle.net/20.500.11937/58661 |
| _version_ | 1848760315361099776 |
|---|---|
| author | Zhang, X. Zhou, Guanglu Caccetta, Louis Alqahtani, M. |
| author_facet | Zhang, X. Zhou, Guanglu Caccetta, Louis Alqahtani, M. |
| author_sort | Zhang, X. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | © 2017 Higher Education Press and Springer-Verlag Berlin Heidelberg We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some eFFIcient algorithms are presented and numerical results are reported to show the eFFIciency of our proposed algorithms. |
| first_indexed | 2025-11-14T10:13:49Z |
| format | Journal Article |
| id | curtin-20.500.11937-58661 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:13:49Z |
| publishDate | 2017 |
| publisher | Gaodeng Jiaoyu Chubanshe |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-586612017-11-24T05:47:22Z Approximation algorithms for nonnegative polynomial optimization problems over unit spheres Zhang, X. Zhou, Guanglu Caccetta, Louis Alqahtani, M. © 2017 Higher Education Press and Springer-Verlag Berlin Heidelberg We consider approximation algorithms for nonnegative polynomial optimization problems over unit spheres. These optimization problems have wide applications e.g., in signal and image processing, high order statistics, and computer vision. Since these problems are NP-hard, we are interested in studying on approximation algorithms. In particular, we propose some polynomial-time approximation algorithms with new approximation bounds. In addition, based on these approximation algorithms, some eFFIcient algorithms are presented and numerical results are reported to show the eFFIciency of our proposed algorithms. 2017 Journal Article http://hdl.handle.net/20.500.11937/58661 10.1007/s11464-017-0644-1 Gaodeng Jiaoyu Chubanshe restricted |
| spellingShingle | Zhang, X. Zhou, Guanglu Caccetta, Louis Alqahtani, M. Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title | Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title_full | Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title_fullStr | Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title_full_unstemmed | Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title_short | Approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| title_sort | approximation algorithms for nonnegative polynomial optimization problems over unit spheres |
| url | http://hdl.handle.net/20.500.11937/58661 |