|
accelerated coordinate descent |
1 |
|
accelerated gradient descent |
1 |
|
algorithms |
1 |
|
analysis of algorithms |
1 |
|
arbitrary sampling |
1 |
|
complexity analysis |
1 |
|
complexity theory |
1 |
|
computational complexity |
1 |
|
consensus |
1 |
|
contraction mapping in thompson's part metric |
1 |
|
contraction rate |
1 |
|
contraction ratio |
1 |
|
coordinate descent |
1 |
|
data-driven speedup |
1 |
|
dobrushin’s ergodicity coefficient |
1 |
|
dual coordinate ascent |
1 |
|
dynamic programming |
1 |
|
empirical risk minimization |
1 |
|
eso |
1 |
|
expected separable overapproximation |
1 |
|
expected smoothness |
1 |
|
explicit inner termination rule |
1 |
|
finsler metric |
1 |
|
formal verification |
1 |
|
game theory |
1 |
|
games |
1 |
|
heuristic algorithms |
1 |
|
indefinite riccati flow |
1 |
|
inexact augmented lagrangian method |
1 |
|
invariant measure |
1 |
|
l-katyusha |
1 |
|
l-svrg |
1 |
|
large scale optimization |
1 |
|
local quadratic error bound |
1 |
|
markov operator |
1 |
|
markov processes |
1 |
|
max-plus basis numerical method |
1 |
|
noncommutative markov chain |
1 |
|
optimization problem |
1 |
|
ordered linear space |
1 |
|
parallel and distributed coordinate descent |
1 |
|
perron-frobenius theory |
1 |
|
polyhedral representation |
1 |
|
quadratic growth condition |
1 |
|
quantum channel |
1 |
|
randomized first-order method |
1 |
|
randomized methods |
1 |
|
rank one matrix |
1 |
|
relative smoothness condition |
1 |
|
restarting |
1 |
|
restarting strategies |
1 |
|
riccati equation |
1 |
|
static analysis |
1 |
|
stochastic control |
1 |
|
stochastic gradient |
1 |
|
switching linear quadratic control |
1 |
|
thompson's part metric |
1 |
|
unknown error bound |
1 |
|
unknown strong convexity |
1 |
|
zero error capacity |
1 |
