@article{Yang_Yang_Zhao_2014, title={Quadratic third-order tensor optimization problem with quadratic constraints}, volume={2}, url={http://iapress.org/index.php/soic/article/view/20140605}, DOI={10.19139/soic.v2i2.67}, abstractNote={Quadratically constrained quadratic programs (QQPs) problems play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Semidenite programming (SDP) relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective.<br /&gt;In this paper, we consider a certain QQP where the variable is neither vector nor matrix but a third-order tensor. This problem can be viewed as a generalization of the ordinary QQP with vector or matrix as it’s variant. Under some mild conditions, we rst show that SDP relaxation provides exact optimal solutions for the original problem. Then we focus on two classes of homogeneous quadratic tensor programming problems which have no requirements on the constraints number. For one, we provide an easily implemental polynomial time algorithm to approximately solve the problem and discuss the approximation ratio. For the other, we show there is no gap between the SDP relaxation and itself.}, number={2}, journal={Statistics, Optimization & Information Computing}, author={Yang, Lixing and Yang, Qingzhi and Zhao, Xiaoming}, year={2014}, month={Jun.}, pages={130-146} }