The cubic spherical optimization problems
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.
- Lower bounds for cubic optimization over the sphere
- Optimization on the Euclidean unit sphere
- Concepts and techniques of optimization on the sphere
- Polynomial optimization on odd-dimensional spheres
- Spherical cuts for integer programming problems
- Properties of combinatorial optimization problems over polyhedral-spherical sets
- Global optimality conditions for cubic minimization problems with cubic constraints
- Spherical fuzzy geometric programming problem
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Eigenvalues of a real supersymmetric tensor
- scientific article; zbMATH DE number 5720489 (Why is no real title available?)
- Independent component analysis, a new concept?
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Rank-one approximation to high order tensors
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Z-eigenvalue methods for a global polynomial optimization problem
- Real eigenvalues of nonsymmetric tensors
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Lower bounds for cubic optimization over the sphere
- Semi-definite representations for sets of cubics on the two-dimensional sphere
- Extremal cubics on the circle and the 2-sphere
- On approximation algorithm for orthogonal low-rank tensor approximation
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- On decompositions and approximations of conjugate partial-symmetric tensors
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Concepts and techniques of optimization on the sphere
- Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
- Rank-1 tensor properties with applications to a class of tensor optimization problems
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Inhomogeneous polynomial optimization over a convex set: an approximation approach
- Practical approximation algorithms for _1-regularized sparse rank-1 approximation to higher-order tensors
- Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
- Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual
- Critical values of multilinear Forms under conic constraints
- Approximation algorithms for optimization of real-valued general conjugate complex forms
- On spectral and nuclear norms of order three tensors with one fixed dimension
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
This page was built for publication: The cubic spherical optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894517)
