Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints (Q625653): Difference between revisions

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.