On solving biquadratic optimization via semidefinite relaxation
From MaRDI portal
Publication:1935575
DOI10.1007/s10589-012-9462-2zbMath1285.90070OpenAlexW1983273924MaRDI QIDQ1935575
Publication date: 18 February 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9462-2
Related Items (4)
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems ⋮ An efficient alternating minimization method for fourth degree polynomial optimization ⋮ Hardness and Approximation Results for Lp-Ball Constrained Homogeneous Polynomial Optimization Problems ⋮ Finding the global optimum of a class of quartic minimization problem
Uses Software
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Ellipticity and deformations with discontinuous gradients in finite elastostatics
- A tensor product matrix approximation problem in quantum physics
- Z-eigenvalue methods for a global polynomial optimization problem
- 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
- Independent component analysis, a new concept?
- A reformulation of the strong ellipticity conditions for unconstrained hyperelastic media
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Semidefinite programming relaxations for semialgebraic problems
- Quadratic maximization and semidefinite relaxation
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- Polynomials nonnegative on a grid and discrete optimization
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Approximating the Cut-Norm via Grothendieck's Inequality
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
This page was built for publication: On solving biquadratic optimization via semidefinite relaxation
