Maximizing $\mbox{Tr}(MX)$ over $X \succeq 0$ with diagonal entries at most $1$

53 Views Asked by At

Does the following optimization problem have an analytic solution?

$$\begin{array}{ll} \text{maximize} & \mbox{Tr}(MX)\\ \text{subject to} & X_{ii} \leq 1 \quad \forall i = 1, \dots, n\\ & X \succeq 0\end{array}$$

where positive semidefinite matrix $M$ is given.