On solving biquadratic optimization via semidefinite relaxation


In this paper, we study a class of biquadratic optimization problems. We first relax the original problem to its semidefinite programming (SDP) problem and discuss the approximation ratio between them. Under some conditions, we show that the relaxed problem is tight. Then we consider how to approximately solve the problems in polynomial time. Under several… (More)
DOI: 10.1007/s10589-012-9462-2

2 Figures and Tables


  • Presentations referencing similar topics