The cubic spherical optimization problems (Q2894517)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6051346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The cubic spherical optimization problems |
scientific article; zbMATH DE number 6051346 |
Statements
The cubic spherical optimization problems (English)
0 references
29 June 2012
0 references
cubic spherical optimization
0 references
approximation solution
0 references
polynomial time approximation scheme
0 references
largest singular value
0 references
numerical results
0 references
0 references
0 references
0.92141294
0 references
0.8978487
0 references
0.8866106
0 references
0.8839996
0 references
0.87816125
0 references
0.87538576
0 references
0.87061995
0 references
0.8696954
0 references
The authors first show that the cubic one-spherical and two-spherical optimization problems are special cases of the three-spherical optimization problem. This fact is used to improve the bounds of a theorem. Then they reformulate the cubic two-spherical optimization problem as an NP-hard quartic optimization problem over a unit sphere. As a result of this reformulation, NP-hardness of the cubic two-spherical and three-spherical optimization problems is established.NEWLINENEWLINEIn the rest of this paper, the authors focus on the cubic three-spherical optimization problem. They show that when some matrices are simultaneously diagonalized the problem is polynomial time solvable. Then they present a relative quality bound by finding the largest singular values of matrices. Finally, a practical method for solving the cubic three-spherical optimization problem is proposed and preliminary numerical results are reported.
0 references
