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 |