Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
Journal of Global Optimization
Polynomial Matrix Inequality and Semidefinite Representation
Mathematics of Operations Research
Alternating direction method for bi-quadratic programming
Journal of Global Optimization
Computational Optimization and Applications
Discriminants and nonnegative polynomials
Journal of Symbolic Computation
Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
Journal of Global Optimization
Maximum Block Improvement and Polynomial Optimization
SIAM Journal on Optimization
Epsilon-net method for optimizations over separable states
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On solving biquadratic optimization via semidefinite relaxation
Computational Optimization and Applications
Globally optimal direction fields
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Hi-index | 0.00 |
This paper studies the so-called biquadratic optimization over unit spheres $\min_{x\in \mathbb{R}^n,y\in \mathbb{R}^m}\sum_{1\leq i,k\leq n,\,1\leq j,l \leq m}b_{ijkl}x_{i}y_{j}x_{k}{y}_l$, subject to $\|x\| = 1$, $\|y\| =1$. We show that this problem is NP-hard, and there is no polynomial time algorithm returning a positive relative approximation bound. Then, we present various approximation methods based on semidefinite programming (SDP) relaxations. Our theoretical results are as follows: For general biquadratic forms, we develop a $\frac{1}{2\max\{m,n\}^2}$-approximation algorithm under a slightly weaker approximation notion; for biquadratic forms that are square-free, we give a relative approximation bound $\frac{1}{nm}$; when $\min\{n,m\}$ is a constant, we present two polynomial time approximation schemes (PTASs) which are based on sum of squares (SOS) relaxation hierarchy and grid sampling of the standard simplex. For practical computational purposes, we propose the first order SOS relaxation, a convex quadratic SDP relaxation, and a simple minimum eigenvalue method and show their error bounds. Some illustrative numerical examples are also included.