Show simple item record

dc.contributor.authorZhang, X.
dc.contributor.authorZhou, Guanglu
dc.contributor.authorCaccetta, Louis
dc.contributor.authorAlqahtani, M.
dc.date.accessioned2017-11-24T05:27:03Z
dc.date.available2017-11-24T05:27:03Z
dc.date.created2017-11-24T04:48:49Z
dc.date.issued2017
dc.identifier.citationZhang, X. and Zhou, G. and Caccetta, L. and Alqahtani, M. 2017. Approximation algorithms for nonnegative polynomial optimization problems over unit spheres. Frontiers of Mathematics in China: pp. 1-18.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/58661
dc.identifier.doi10.1007/s11464-017-0644-1
dc.description.abstract

© 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.

dc.publisherGaodeng Jiaoyu Chubanshe
dc.titleApproximation algorithms for nonnegative polynomial optimization problems over unit spheres
dc.typeJournal Article
dcterms.source.startPage1
dcterms.source.endPage18
dcterms.source.issn1673-3452
dcterms.source.titleFrontiers of Mathematics in China
curtin.departmentDepartment of Mathematics and Statistics
curtin.accessStatusFulltext not available


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record