Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
From MaRDI portal
Publication:4909732
DOI10.1002/NLA.781zbMATH Open1274.65170OpenAlexW2097504558MaRDI QIDQ4909732FDOQ4909732
Authors: Chen Ling, Xinzhen Zhang, 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
Recommendations
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- On solving biquadratic optimization via semidefinite relaxation
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
global minimumNP-hardsemidefinite programming relaxationapproximation solutionbi-quadratic optimizationquadratic polynomial optimization
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Semidefinite programming (90C22)
Cites Work
- Independent component analysis, a new concept?
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Z-eigenvalue methods for a global polynomial optimization problem
- On the best rank-1 approximation of higher-order supersymmetric tensors
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- On the failure of ellipticity of the equations for finite elastostatic plane strain
- Rank-one approximation to high order tensors
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- Approximating quadratic programming with bound and quadratic constraints
- On copositive matrices and strong ellipticity for isotropic elastic materials
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Approximation algorithms for quadratic programming
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
Cited In (13)
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- On solving biquadratic optimization via semidefinite relaxation
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Standard tensor and its applications in problem of singular values of tensors
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Finding the extreme \(Z\)-eigenvalues of tensors via a sequential semidefinite programming method.
This page was built for publication: Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909732)
