I'm stuck on showing that the following set is convex.
$$\{x:\|x-x_0\|_2\leq \|x-y\|_2 \text{ for all } y\in S\},$$ where $S\subset \mathbb{R}^n$.
$\|x-x_0\|_2\leq \|x-y\|_2$ implies $(x_0-y)^Tx\geq 0$, which a half-space. Therefore, this set is equivalent to the intersection of half-spaces: $$\bigcap_{y\in S}\{x:(x_0-y)^Tx\geq 0\}.$$
It's not clear to me why $\|x-x_0\|_2\leq \|x-y\|_2$ implies $(x_0-y)^Tx\geq 0$.
As $\|x-x_0\|_2\leq \|x-y\|_2$, we get $(x-x_0)^T(x-x_0)\leq (x-y)^T(x-y)$. Hence, $$x^Tx-x^Tx_0-x_0^Tx+x_0^Tx_0\leq x^Tx-x^Ty-y^Tx+y^Ty$$ I guess I'm allowed to say that $x^Tx_0=x_0^Tx$. Therefore, $$x^T_0x_0\leq 2x^T(x_0-y)+y^Ty$$
But I don't know how I can prove $(x_0-y)^Tx\geq 0$.