The cubic spherical optimization problems

DOI10.1090/S0025-5718-2012-02577-4zbMath1252.65101OpenAlexW2018052835MaRDI QIDQ2894517

Liqun Qi, Xinzhen Zhang, Yinyu Ye

Publication date: 29 June 2012

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-2012-02577-4

zbMATH Keywords

numerical resultslargest singular valuepolynomial time approximation schemeapproximation solutioncubic spherical optimization

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)

Related Items

A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Extremal cubics on the circle and the 2-sphere, Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems, On approximation algorithm for orthogonal low-rank tensor approximation, Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors, Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method, Practical approximation algorithms for \(\ell_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, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, On decompositions and approximations of conjugate partial-symmetric tensors, Approximation algorithms for optimization of real-valued general conjugate complex forms, Real eigenvalues of nonsymmetric tensors, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Lower bounds for cubic optimization over the sphere, SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Hardness and Approximation Results for L_p-Ball Constrained Homogeneous Polynomial Optimization Problems, Semi-definite representations for sets of cubics on the two-dimensional sphere

Cites Work

• Unnamed Item
• Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
• Z-eigenvalue methods for a global polynomial optimization problem
• Independent component analysis, a new concept?
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Eigenvalues of a real supersymmetric tensor
• Rank-One Approximation to High Order Tensors
• On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
• Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors