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 Theses
    • View Item
    • espace Home
    • espace
    • Curtin Theses
    • View Item

    Numerical Algorithms for Polynomial Optimisation Problems with Applications

    Alqahtani MAM 2019 part.pdf (472.9Kb)
    Access Status
    Open access
    Authors
    Alqahtani, Mohammed Aeyed M
    Date
    2019
    Supervisor
    Guanglu Zhou
    Type
    Thesis
    Award
    PhD
    
    Metadata
    Show full item record
    Faculty
    Science and Engineering
    School
    School of Electrical Engineering, Computing and Mathematical Sciences
    URI
    http://hdl.handle.net/20.500.11937/73582
    Collection
    • Curtin Theses
    Abstract

    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 partition of the tensors. We also propose some polynomial time approximation algorithms with new approximation bounds for nonnegative polynomial optimization problems over unit spheres. Furthermore, we develop an efficient and effective algorithm for the maximum clique problem.

    Related items

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

    • Heuristic algorithms for routing problems.
      Chong, Yen N. (2001)
      General routing problems deal with transporting some commodities and/or travelling along the axes of a given network in some optimal manner. In the modern world such problems arise in several contexts such as distribution ...
    • Global optimization for nonconvex optimization problems
      Ruan, Ning (2012)
      Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality ...
    • 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 ...
    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.