Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
From MaRDI portal
Publication:3586136
DOI10.1137/080729104zbMath1221.90074MaRDI QIDQ3586136
Chen Ling, Jia-Wang Nie, Liqun Qi, Yinyu Ye
Publication date: 6 September 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/4766
semidefinite programming; approximate solution; sum of squares; polynomial time approximation scheme; biquadratic optimization
90C22: Semidefinite programming
90C26: Nonconvex programming, global optimization
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Polynomial Norms, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, Unnamed Item, Best Nonnegative Rank-One Approximations of Tensors, Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Unnamed Item, Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems, Convergence analysis of a block improvement method for polynomial optimization over unit spheres, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem, Bounds of M-eigenvalues and strong ellipticity conditions for elasticity tensors, Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations, Quaternion matrix decomposition and its theoretical implications, Conditions of strong ellipticity and calculations of M-eigenvalues for a partially symmetric tensor, An alternating shifted inverse power method for the extremal eigenvalues of fourth-order partially symmetric tensors, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Concepts and techniques of optimization on the sphere, Non-Markovian dynamics of open quantum systems: stochastic equations and their perturbative solutions, Standard bi-quadratic optimization problems and unconstrained polynomial reformulations, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, Epsilon-net method for optimizations over separable states, On cones of nonnegative quartic forms, \(l^{k,s}\)-singular values and spectral radius of partially symmetric rectangular tensors, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, Alternating direction method for bi-quadratic programming, Discriminants and nonnegative polynomials, Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Approximation methods for complex polynomial optimization, Singular values of a real rectangular tensor, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Positive definiteness of paired symmetric tensors and elasticity tensors, DC decomposition of nonconvex polynomials with algebraic techniques, Theorems of the alternative for inequality systems of real polynomials, Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor, On solving biquadratic optimization via semidefinite relaxation, NP-hardness of deciding convexity of quartic polynomials and related problems, Bi-block positive semidefiniteness of bi-block symmetric tensors, Biquadratic tensors, biquadratic decompositions, and norms of biquadratic tensors, An efficient alternating minimization method for fourth degree polynomial optimization, Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game, Sharp bounds on the minimum \(M\)-eigenvalue and strong ellipticity condition of elasticity \(Z\)-tensors-tensors, Criteria for the strong ellipticity condition of a partially symmetric tensor, M-eigenvalue intervals and checkable sufficient conditions for the strong ellipticity, New M-eigenvalue inclusion sets for fourth-order partially symmetric tensors with applications, New S-type inclusion theorems for the M-eigenvalues of a 4th-order partially symmetric tensor with applications, Programmable sufficient conditions for the strong ellipticity of partially symmetric tensors, \(M\)-eigenvalues-based sufficient conditions for the positive definiteness of fourth-order partially symmetric tensors, Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors, Global optimization with orthogonality constraints via stochastic diffusion on manifold, On the spherical convexity of quadratic functions, Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior, M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor, A successive approximation method for quantum separability, Parameterized S-type M-eigenvalue inclusion intervals for fourth-order partially symmetric tensors and its applications, The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors, Positive Maps and Separable Matrices, The cubic spherical optimization problems, A note on approximating quadratic programming with rank constraint, A survey on the spectral theory of nonnegative tensors, Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method, A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication
