Is there an algorithm to solve the QCQP
$$\begin{array}{ll} \text{maximize} & x^T A^T B \, x\\ \text{subject to} & \|x\|_2 = 1\end{array}$$
when $A^T B$ is not necessarily symmetric? When $A^T B$ is symmetric, there is a simple solution. However in this context I do not know how to proceed. Thanks.