How to obtain the dual of the following semidefinite programming problem (SDP)
\begin{align} \text{minimize}_{X \in \mathcal{S}^n} \quad & {\rm trace}( W X ) \\ \text{subject to }\quad & X_{ii} = 1 \Longleftrightarrow {\rm trace}( e_i^T X e_i) = 1 \quad \forall i = 1,\ldots,n\\ & X \succeq 0 \ \Longleftrightarrow -{\rm trace}( a^T X a) \leq 0 , \quad {\rm for all } \ a \in \mathbb{R}^n \diagdown 0. \end{align} where $e \in \mathbb{R}^n$ is a standard basis vector, $X \in \mathcal{S}^{n \times n}$ symmetric matrices, and $W \in \mathbb{R}^{n \times n}$.
This is the SDP relaxation of a binary quadratic program. Therefore, as noted e.g. in section 1.2 of these notes, it has the following dual problem: \begin{align*} \max \quad & \mathrm{tr}(\Lambda)\\ \text{s.t.} \quad & W \succeq \Lambda,\\ & \Lambda_{i,j}=0, \ \forall i \neq j. \end{align*}