Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
From MaRDI portal
Publication:3586136
DOI10.1137/080729104zbMath1221.90074OpenAlexW2128762995MaRDI 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 programmingapproximate solutionsum of squarespolynomial time approximation schemebiquadratic optimization
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure, Bounds of M-eigenvalues and strong ellipticity conditions for elasticity tensors, Concepts and techniques of optimization on the sphere, The cubic spherical optimization problems, A note on approximating quadratic programming with rank constraint, Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors, Sparse Model Uncertainties in Compressed Sensing with Application to Convolutions and Sporadic Communication, Criteria for the strong ellipticity condition of a partially symmetric tensor, A survey on the spectral theory of nonnegative tensors, Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Unnamed Item, On the spherical convexity of quadratic functions, Convergence of an algorithm for the largest singular value of a nonnegative rectangular tensor, M-eigenvalue intervals and checkable sufficient conditions for the strong ellipticity, Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations, Quaternion matrix decomposition and its theoretical implications, Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior, On solving biquadratic optimization via semidefinite relaxation, Conditions of strong ellipticity and calculations of M-eigenvalues for a partially symmetric tensor, M-eigenvalue inclusion intervals for a fourth-order partially symmetric tensor, Unnamed Item, Non-Markovian dynamics of open quantum systems: stochastic equations and their perturbative solutions, Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints, Shifted inverse power method for computing the smallest M-eigenvalue of a fourth-order partially symmetric tensor, NP-hardness of deciding convexity of quartic polynomials and related problems, 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 direct method for calculating M-eigenvalues of an elasticity tensor, Standard bi-quadratic optimization problems and unconstrained polynomial reformulations, 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, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems, Polynomial Norms, Alternating direction method for bi-quadratic programming, Discriminants and nonnegative polynomials, Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints, Epsilon-net method for optimizations over separable states, New M-eigenvalue inclusion sets for fourth-order partially symmetric tensors with applications, Positive definiteness of paired symmetric tensors and elasticity tensors, A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor, 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, Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints, DC decomposition of nonconvex polynomials with algebraic techniques, On cones of nonnegative quartic forms, \(l^{k,s}\)-singular values and spectral radius of partially symmetric rectangular tensors, Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces, Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems, Theorems of the alternative for inequality systems of real polynomials, Convergence analysis of a block improvement method for polynomial optimization over unit spheres, Singular values of a real rectangular tensor, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Best Nonnegative Rank-One Approximations of Tensors, A successive approximation method for quantum separability, \(M\)-eigenvalues-based sufficient conditions for the positive definiteness of fourth-order partially symmetric tensors, Bi-block positive semidefiniteness of bi-block symmetric tensors, Biquadratic tensors, biquadratic decompositions, and norms of biquadratic tensors, Approximation methods for complex polynomial optimization, Positive Maps and Separable Matrices, Partially symmetric nonnegative rectangular tensors and copositive rectangular tensors, Global optimization with orthogonality constraints via stochastic diffusion on manifold, An efficient alternating minimization method for fourth degree polynomial optimization, Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game, Inhomogeneous polynomial optimization over a convex set: An approximation approach, Sharp bounds on the minimum \(M\)-eigenvalue and strong ellipticity condition of elasticity \(Z\)-tensors-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, A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
