Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
From MaRDI portal
Publication:625653
DOI10.1007/s10898-010-9545-5zbMath1237.90180OpenAlexW2149049779MaRDI QIDQ625653
Liqun Qi, Chen Ling, Xinzhen Zhang
Publication date: 25 February 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9545-5
Related Items
On solving biquadratic optimization via semidefinite relaxation ⋮ Alternating direction method for bi-quadratic programming ⋮ Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints ⋮ Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints ⋮ Approximation algorithms for nonnegative polynomial optimization problems over unit spheres ⋮ Standard tensor and its applications in problem of singular values of tensors ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- A tensor product matrix approximation problem in quantum physics
- Conditions for strong ellipticity of anisotropic elastic materials
- Conditions for strong ellipticity and M-eigenvalues
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Independent component analysis, a new concept?
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- Topics in semidefinite and interior-point methods
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Rank-One Approximation to High Order Tensors
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- A Unified Theorem on SDP Rank Reduction
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- 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
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Complex Matrix Decomposition and Quadratic Programming
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- On Cones of Nonnegative Quadratic Functions
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Introduction to global optimization.
This page was built for publication: Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
