On solving biquadratic optimization via semidefinite relaxation
From MaRDI portal
Publication:1935575
DOI10.1007/S10589-012-9462-2zbMATH Open1285.90070OpenAlexW1983273924MaRDI QIDQ1935575FDOQ1935575
Authors: Yuning Yang, Qingzhi Yang 
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
Recommendations
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Quadratic maximization and semidefinite relaxation
- Semidefinite relaxation and nonconvex quadratic optimization
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
- Eigenvalues of a real supersymmetric tensor
- Global optimization with polynomials and the problem of moments
- Approximating the Cut-Norm via Grothendieck's Inequality
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Z-eigenvalue methods for a global polynomial optimization problem
- Semidefinite programming relaxations for semialgebraic problems
- A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Conditions for strong ellipticity of anisotropic elastic materials
- A tensor product matrix approximation problem in quantum physics
- 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
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Quadratic maximization and semidefinite relaxation
- 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
- Polynomials nonnegative on a grid and discrete optimization
- Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies
Cited In (14)
- Finding the global optimum of a class of quartic minimization problem
- Bi-parametric convex quadratic optimization
- Tighter bound estimation for efficient biquadratic optimization over unit spheres
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- A new relaxation bound for a biquadratic optimization problem with unit spheres
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
- An efficient alternating minimization method for fourth degree polynomial optimization
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
- 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
- Exact SDP relaxations for quadratic programs with bipartite graph structures
Uses Software
This page was built for publication: On solving biquadratic optimization via semidefinite relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935575)
