Lemma 3.7. The number of iterations for the FW Algorithm to reach an iterate $u$ with $\delta(u)\le1$ is at most
(ii) $4n(\ln\ln n + 7/2)$ if the initial iterate is $u_{KY}$
天道酬勤
Lemma 3.7. The number of iterations for the FW Algorithm to reach an iterate $u$ with $\delta(u)\le1$ is at most
(ii) $4n(\ln\ln n + 7/2)$ if the initial iterate is $u_{KY}$
npm install hexo-generator-searchdb --save
1 | search: |
1 | local_search: |
改为
1 | local_search: |
参考github文档
$...$
$$...$$
字体 | 代码 | 效果 |
---|---|---|
空心字体 | \mathbb{ABC123} |
$ \mathbb{ABC123} $ |
boldface字体 | \mathbf{ABC123} |
$ \mathbf{ABC123} $ |
calligraphic字体 | \mathcal{ABC123} |
$ \mathcal{ABC123} $ |
script字体 | \mathscr{ABC123} |
$ \mathscr{ABC123} $ |
typewriter字体 | \mathtt{ABC123} |
$ \mathtt{ABC123} $ |
roman字体 | \mathrm{ABC123} |
$ \mathrm{ABC123} $ |
sans-0serif字体 | \mathsf{ABC123} |
$ \mathsf{ABC123} $ |
Fraktur字体 | \mathfrak{ABC123} |
$ \mathfrak{ABC123} $ |