Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Nonnegative polynomial optimization over unit spheres and convex programming relaxations

    189761_73626_Nonnegative_polynomial_optimization_over_unit_spheres_and_convex_programming_relaxations.pdf (245.3Kb)
    Access Status
    Open access
    Authors
    Zhou, Guanglu
    Caccetta, Louis
    Teo, Kok Lay
    Wu, S.
    Date
    2012
    Type
    Journal Article
    
    Metadata
    Show full item record
    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.
    Source Title
    SIAM Journal on Optimization
    DOI
    10.1137/110827910
    ISSN
    0363-0129
    Remarks

    Copyright © 2012 Society for Industrial and Applied Mathematics

    URI
    http://hdl.handle.net/20.500.11937/46637
    Collection
    • Curtin Research Publications
    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.

    Related items

    Showing items related by title, author, creator and subject.

    • Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
      Zhang, X.; Zhou, Guanglu; Caccetta, Louis; Alqahtani, M. (2017)
      © 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 ...
    • Optimisation of large scale network problems
      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 ...
    • Numerical Algorithms for Polynomial Optimisation Problems with Applications
      Alqahtani, Mohammed Aeyed M (2019)
      In this thesis, we study tensor eigenvalue problems and polynomial optimization problems. In particular, we present a fast algorithm for computing the spectral radii of symmetric nonnegative tensors without requiring the ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.