Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
From MaRDI portal
Publication:625653
DOI10.1007/S10898-010-9545-5zbMATH Open1237.90180OpenAlexW2149049779MaRDI QIDQ625653FDOQ625653
Authors: Xinzhen Zhang, Chen Ling, Liqun Qi 
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
Recommendations
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- On solving biquadratic optimization via semidefinite relaxation
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Semidefinite relaxation and nonconvex quadratic optimization
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds
Cites Work
- Independent component analysis, a new concept?
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- On the best rank-1 approximation of higher-order supersymmetric tensors
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Topics in semidefinite and interior-point methods
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Introduction to global optimization.
- Conditions for strong ellipticity of anisotropic elastic materials
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- A tensor product matrix approximation problem in quantum physics
- Title not available (Why is that?)
- Rank-one approximation to high order tensors
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- On maximization of quadratic form over intersection of ellipsoids with common center
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- Conditions for strong ellipticity and M-eigenvalues
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- A Unified Theorem on SDP Rank Reduction
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- Title not available (Why is that?)
- Complex Matrix Decomposition and Quadratic Programming
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
Cited In (17)
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Title not available (Why is that?)
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
- Quadratic maximization and semidefinite relaxation
- Further results of \(\mathrm{M}\)-eigenvalue localization theorem for fourth-order partially symmetric tensors and their applications
- Tighter bound estimation for efficient biquadratic optimization over unit spheres
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- On solving biquadratic optimization via semidefinite relaxation
- 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
- Alternating direction method for bi-quadratic programming
- An efficient alternating minimization method for fourth degree polynomial optimization
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
This page was built for publication: Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625653)
