Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
From MaRDI portal
Publication:625653
The paper focuses on bi-quadratic optimization, a difficult nonconvex optimization problem with potential applications in quantum physics (entanglement problem) or signal and image processing (tensor approximation). The authors study bounds derived from semidefinite programming (SDP) relaxations. First they relax the bi-quadratic problem into bi-linear SDP problems which are themselves difficult to solve. Second they use classical linear SDP relaxations of the bi-linear problems to derive bounds for the original bi-quadratic problem.
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
- A practical method for computing the largest M-eigenvalue of a fourth-order partially symmetric tensor
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- A tensor product matrix approximation problem in quantum physics
- A Unified Theorem on SDP Rank Reduction
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Complex Matrix Decomposition and Quadratic Programming
- Conditions for strong ellipticity and M-eigenvalues
- Conditions for strong ellipticity of anisotropic elastic materials
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- scientific article; zbMATH DE number 425777 (Why is no real title available?)
- scientific article; zbMATH DE number 1047682 (Why is no real title available?)
- Independent component analysis, a new concept?
- Introduction to global optimization.
- New Results on Quadratic Minimization
- On Cones of Nonnegative Quadratic Functions
- On maximization of quadratic form over intersection of ellipsoids with common center
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the best rank-1 approximation of higher-order supersymmetric tensors
- On the ellipticity of the equations of nonlinear elastostatics for a special material
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Polynomial primal-dual cone affine scaling for semidefinite programming
- Rank-one approximation to high order tensors
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
- Topics in semidefinite and interior-point methods
Cited in
(17)- Quadratic maximization and semidefinite relaxation
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- On solving biquadratic optimization via semidefinite relaxation
- An efficient alternating minimization method for fourth degree polynomial optimization
- Standard tensor and its applications in problem of singular values of 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
- scientific article; zbMATH DE number 1751736 (Why is no real title available?)
- Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems
- Alternating direction method for bi-quadratic programming
- 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
- Approximation algorithms for nonnegative polynomial optimization problems over unit spheres
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)
