Minimize using semidefinite programming

53 Views Asked by At

I have the following optimization problem in $Q \in \mathbb R^{m \times n}$

$$\text{minimize} \quad \mbox{Tr}(CQ) + \|Q\|_1$$

where $\| \cdot \|_1$ denotes the sum of absolute values of the matrix entries. How to write an equivalent optimization problem in SDP form?