I have this quadratic function $x'Ax$ which is not convex. I want to maximize this function subject to the constraints that the solution x lies in a simplex such that $\sum_{i=1}^{n}x_i=1$. That means the solution lies in a simplex and $x \epsilon [0,1]^n$.
I want to write an iterative procedure to do this. Suggestions?