Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
From MaRDI portal
Publication:481050
DOI10.1007/s10957-014-0538-2zbMath1335.90076OpenAlexW1976346981MaRDI QIDQ481050
Yuning Yang, Qingzhi Yang, Liqun Qi
Publication date: 12 December 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0538-2
convex bodiessemidefinite relaxationapproximation boundbiquadratic optimizationpolynomial-optimizationtrilinear optimization
Related Items
Cites Work
- 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
- Conditions for strong ellipticity of anisotropic elastic materials
- Conditions for strong ellipticity and M-eigenvalues
- Geometric algorithms and combinatorial optimization
- Quadratic maximization and semidefinite relaxation
- On maximization of quadratic form over intersection of ellipsoids with common center
- Eigenvalues of a real supersymmetric tensor
- The cubic spherical optimization problems
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Deterministic and randomized polynomial‐time approximation of radii
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
- Blind constant modulus equalization via convex optimization
- Approximation Methods for Polynomial Optimization
- Approximating the Cut-Norm via Grothendieck's Inequality
This page was built for publication: Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
