```markdown
### Image Description

**Title:** Semidefinite programming: CVX

**Content:**

- The slide discusses solving the maxcut relaxation problem using semidefinite programming.
- The mathematical formulation is given as:

  \[
  \begin{align*}
  \text{max.} \quad & \text{Tr}(XC) \\
  \text{s.t.} \quad & \text{diag}(X) = 1 \\
  & X \succeq 0,
  \end{align*}
  \]

- The CVX/MATLAB code implementation is provided:

  ```plaintext
  cvx_begin
  . variable X(n,n) symmetric
  . maximize trace(C*X)
  . subject to
  . diag(X)==1
  . X==semidefinite(n)
  cvx_end
  ```

**Footer:** A. d’Aspremont. Convex Optimization M2. Page 36/36
```
