On page 399 of Boyd & Vandenberghe's Convex Optimization, it is stated that the projection of a symmetric $n \times n$ matrix $X_0$ onto the set of symmetric $n \times n$ positive semidefinite matrices $S^n_+$ is found in the following way:
Find the spectral (eigenvalue) decomposition $$X_0 = \sum_{i=1}^n \lambda_i v_i v_i^T$$
Define the projection $$X = \sum_{i=1}^n \max\{\lambda_i, 0\} v_i v_i^T$$
It is proven in the book that $X$ is the solution of the problem
$$\underset{X}{\text{minimize}} \quad \| X - X_0 \|_F^2 \quad \text{subject to} \quad X \succeq 0$$
where $\|A\|_F^2 = \operatorname{tr} \left(A^T A\right)$ is a square of the Frobenius norm. In other words, $X$ is the projection of $X_0$ onto symmetric positive semidefinite matrix cone with respect to the Frobenius norm.
I have also found a proof of this in this question.
Now the book also states (without a proof, or at least it is not obvious for me from the material) that $X$ is also a solution to the problem
$$\underset{X}{\text{minimize}} \quad \| X - X_0 \|_2 \quad \text{subject to} \quad X \succeq 0$$
where $\|A\|_2$ ($A$ being symmetric) is the spectral norm,
$$\|A\|_2 = \max_{i=1, \dots, n}|\lambda_i| = \max\{\lambda_1, -\lambda_n\}$$
where $\lambda_i$ are the eigenvalues of $A$, $\lambda_1 \geq \lambda_2 \geq \dots \geq \lambda_n$. How to prove this?