## Approximation algorithms for trilinear optimization with nonconvex constraints and its extensions

In this paper, we study trilinear optimization problems with nonconvex constraints under some assumptions. We first consider the semidefinite relaxation (SDR) of the original problem. Then motivated by So \cite{So2010}, we reduce the problem to that of determining the \$L_2\$-diameters of certain convex bodies, which can be approximately solved in deterministic polynomial-time. After the relaxed … Read more