Here is another approach:
Let $A=\begin{bmatrix} 0 & 1 \\ 1 & 2 \end{bmatrix}$ and write the problem as
$\max \{ {1 \over 2} x^T Ax | \|x\| = 1, x_1 \ge 0 \}$ (where $x=(x_1,x_2)^T$ for notational convenience). Note that $A$ is real and symmetric.
Note that the constraint $x_1 \ge 0$ is unnecessary since if $x$ solves
$\max \{ {1 \over 2} x^T Ax | \|x\| \le 1 \}$, then $(\operatorname{sgn} x_1)x$
is also a solution and solves the original problem.
Hence we can look for solutions of $\max \{ {1 \over 2} x^T Ax | \|x\| \le 1 \}$.
Since $A$ is symmetric, it has an orthonormal basis of eigenvectors $v_1,v_2$ and
with $V=[v_1 \ v_2]$, and $y=V^{-1} x$ we have
$x^T Ax = \lambda_1 y_1^2+\lambda_2 y_2^2$ and $\|x\| = \|y\|$.
Without loss of generality, take $\lambda_1 \ge \lambda_2$.
It is straightforward to check that $\lambda_1= 1+ \sqrt{2}>0$,
and that
$\lambda_1 \|y\|^2 =\lambda_1 \ge \lambda_1 y_1^2+\lambda_2 y_2^2$,
and so
$\max \{ {1 \over 2} (\lambda_1 y_1^2+\lambda_2 y_2^2) | \|y\| \le 1 \} = {1 \over 2} \lambda_1$ and a (in fact, the) maximising $y$ is $(1,0)^T$.
Hence the problem reduces to finding a unit eigenvector corresponding
to $\lambda_1$, and it is easy to check that
$x= ({ 1\over \sqrt{2} \sqrt{2+ \sqrt{2}}}, { 1+ \sqrt{2}\over \sqrt{2} \sqrt{2+ \sqrt{2}}} )^T$ is a solution.