Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sodt, Braeden"'
Given an initial point $x_0 \in \mathbb{R}^d$ and a sequence of vectors $v_1, v_2, \dots$ in $\mathbb{R}^d$, we define a greedy sequence by setting $x_{n} = x_{n-1} \pm v_n$ where the sign is chosen so as to minimize $\|x_n\|$. We prove that if the v
Externí odkaz:
http://arxiv.org/abs/2412.04284
