Prove that the following set is convex $$\{ x : \|Ax + b\|_2 \leq c^Tx + d\}$$
My initial thought is to choose two points $x_1,x_2$ in the set and then plug this back into the inequality to prove convexity, so:
$||Ax+b||_2 \Rightarrow ||A(\lambda x_1+(1-\lambda)x_2)+b||_2$ $\Rightarrow ||\lambda (Ax_1+b) +(1-\lambda)(Ax_2+b)||_2 \leq \lambda ||Ax_1+b||_2 +(1-\lambda)||Ax_2+b||_2$
This proves convexity of the LHS. I would then do the same for the RHS and because the LHS must be less than or equal to the RHS it must be a set contained within the RHS. Thus all x that satisfy the condition would be contained within the intersection of two convex sets and therefore the set is convex.
Is this the right way to think about it or am I totally off? Thanks in advance for the help!