On cones of nonnegative quartic forms
From MaRDI portal
Publication:525602
DOI10.1007/s10208-015-9286-4zbMath1367.15043OpenAlexW2175978120MaRDI QIDQ525602
Zhening Li, Bo Jiang, Shu-Zhong Zhang
Publication date: 5 May 2017
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-015-9286-4
convexitynonlinear optimizationpositive semidefiniteprimal-dual pairNP-hard problemspositive quartic formspositivity of polynomialssum of powers of linear formssum of squares of quadratic formssuper-symmetric tensors
Convex programming (90C25) Duality theory (optimization) (49N15) Quadratic and bilinear forms, inner products (15A63) Multilinear algebra, tensor calculus (15A69)
Related Items
Further results on sum-of-squares tensors, Self-concordance is NP-hard, Further investigation of positive semi-definiteness of fourth-order Cauchy and Hilbert tensors, Some inequalities on the spectral radius of nonnegative tensors, On New Classes of Nonnegative Symmetric Tensors, A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization, A new algorithm for concave quadratic programming, The Computational Complexity of Duality, Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representing quadratically constrained quadratic programs as generalized copositive programs
- On the computational complexity of membership problems for the completely positive cone and its dual
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Partitioning procedure for polynomial optimization
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Optimization based scheduling for a class of production systems with integral constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Open questions in complexity theory for numerical optimization
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- A tensor product matrix approximation problem in quantum physics
- Z-eigenvalue methods for a global polynomial optimization problem
- Extremal positive semidefinite forms
- Banach spaces with polynomial norms
- A GRASP for the biquadratic assignment problem
- Heuristics for biquadratic assignment problems and their computational comparison
- Block tensors and symmetric embeddings
- NP-hardness of deciding convexity of quartic polynomials and related problems
- Tensor principal component analysis via convex optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Eigenvalues of a real supersymmetric tensor
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- Blenders
- The spectral theory of tensors and its applications
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Sums of even powers of real linear forms
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- A Quick Proof for the Volume of n-Balls
- Multivariate Nonnegative Quadratic Mappings
- On Tensors, Sparsity, and Nonnegative Factorizations
- Moments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables
- Approximation Methods for Polynomial Optimization
- Most Tensor Problems Are NP-Hard
- Inhomogeneous polynomial optimization over a convex set: An approximation approach
- On Cones of Nonnegative Quadratic Functions
