Theorem 16 ([1]})  
Let \(\mathbf {A}_1,\ldots ,\mathbf {A}_m \in \mathbb {R}^n\) , \(\mathbf {x}_0 \in [-1,1]^n\) , \(\delta >0\)  small enough and let \(\lambda _1,\ldots ,\lambda _m \ge 0\)  so that \(\sum _{i=1}^m \exp (-\lambda _i^2/16) \le \frac{n}{16}\) . Then there exists an efficient randomized algorithm which with probability at least \(\frac{1}{10}\)  finds a point \(\mathbf {x} \in [-1,1]^n\)  so that
