The generic big-M model would be
$$ -Mx_k \leq w_k \leq Mx_k, ~||w_k||\geq \epsilon -M(1-x_k) $$
However, this is a nasty model as you have a non-convex constraint on the norm. Hence, you will have to work on an elementwise level to force at least one element to be non-zero. To do that, introduce a binary vector $y_k$ to indicate that corresponding element in $w_k$ is positive, and a binary vector $z_k$ to indicate negative, and you could use
$$ -Mx_k \leq w_k \leq Mx_k,~w_k \geq \epsilon - M(1-y_k), ~w_k \leq -\epsilon + M(1-z_k), ~\sum_i y^i_k + \sum_i z^i_k = x_k $$
...and now I saw you have a complex-valued vector. Simply repeat the same elementwise model for both the real and imaginary part, i.e. effectively define a new vector $w_k$ by stacking the real and imaginary part in a vector twice as large.