Numerical Algorithms for Polynomial Optimisation Problems with Applications
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 al...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
Curtin University
2019
|
| Online Access: | http://hdl.handle.net/20.500.11937/73582 |
| _version_ | 1848763452556836864 |
|---|---|
| author | Alqahtani, Mohammed Aeyed M |
| author_facet | Alqahtani, Mohammed Aeyed M |
| author_sort | Alqahtani, Mohammed Aeyed M |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T11:03:41Z |
| format | Thesis |
| id | curtin-20.500.11937-73582 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T11:03:41Z |
| publishDate | 2019 |
| publisher | Curtin University |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-735822019-04-09T06:26:36Z Numerical Algorithms for Polynomial Optimisation Problems with Applications Alqahtani, Mohammed Aeyed M 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. 2019 Thesis http://hdl.handle.net/20.500.11937/73582 Curtin University fulltext |
| spellingShingle | Alqahtani, Mohammed Aeyed M Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title | Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title_full | Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title_fullStr | Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title_full_unstemmed | Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title_short | Numerical Algorithms for Polynomial Optimisation Problems with Applications |
| title_sort | numerical algorithms for polynomial optimisation problems with applications |
| url | http://hdl.handle.net/20.500.11937/73582 |