Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
From MaRDI portal
Publication:4909732
DOI10.1002/nla.781zbMath1274.65170OpenAlexW2097504558MaRDI QIDQ4909732
Xinzhen Zhang, Chen Ling, Liqun Qi
Publication date: 21 March 2013
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.781
NP-hardglobal minimumsemidefinite programming relaxationapproximation solutionbi-quadratic optimizationquadratic polynomial optimization
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Quadratic programming (90C20)
Related Items (6)
Global optimality conditions and optimization methods for constrained polynomial programming problems ⋮ Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method ⋮ Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game ⋮ Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
Cites Work
- On copositive matrices and strong ellipticity for isotropic elastic materials
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- Z-eigenvalue methods for a global polynomial optimization problem
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- On the failure of ellipticity of the equations for finite elastostatic plane strain
- Independent component analysis, a new concept?
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- Approximation algorithms for quadratic programming
- Approximating quadratic programming with bound and quadratic constraints
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- New Results on Quadratic Minimization
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
