Show simple item record

dc.contributor.authorAlqahtani, Mohammed Aeyed M
dc.contributor.supervisorGuanglu Zhouen_US

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.

dc.publisherCurtin Universityen_US
dc.titleNumerical Algorithms for Polynomial Optimisation Problems with Applicationsen_US
curtin.departmentSchool of Electrical Engineering, Computing and Mathematical Sciencesen_US
curtin.accessStatusOpen accessen_US
curtin.facultyScience and Engineeringen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record