| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Accelerating variance-reduced stochastic gradient methods
|
Driggs, Derek
|
|
|
191 |
2 |
p. 671-715
|
artikel
|
| 2 |
A hybrid stochastic optimization framework for composite nonconvex optimization
|
Tran-Dinh, Quoc
|
|
|
191 |
2 |
p. 1005-1071
|
artikel
|
| 3 |
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
|
Bruggmann, Simon
|
|
|
191 |
2 |
p. 795-845
|
artikel
|
| 4 |
A stability result for linear Markovian stochastic optimization problems
|
Kiszka, Adriana
|
|
|
191 |
2 |
p. 871-906
|
artikel
|
| 5 |
Complete positivity and distance-avoiding sets
|
DeCorte, Evan
|
|
|
191 |
2 |
p. 487-558
|
artikel
|
| 6 |
Complexity of stochastic dual dynamic programming
|
Lan, Guanghui
|
|
|
191 |
2 |
p. 717-754
|
artikel
|
| 7 |
Convex graph invariant relaxations for graph edit distance
|
Candogan, Utkan Onur
|
|
|
191 |
2 |
p. 595-629
|
artikel
|
| 8 |
General bounds for incremental maximization
|
Bernstein, Aaron
|
|
|
191 |
2 |
p. 953-979
|
artikel
|
| 9 |
New limits of treewidth-based tractability in optimization
|
Faenza, Yuri
|
|
|
191 |
2 |
p. 559-594
|
artikel
|
| 10 |
Optimal sampled-data controls with running inequality state constraints: Pontryagin maximum principle and bouncing trajectory phenomenon
|
Bourdin, Loïc
|
|
|
191 |
2 |
p. 907-951
|
artikel
|
| 11 |
Performance guarantees of local search for minsum scheduling problems
|
Correa, José R.
|
|
|
191 |
2 |
p. 847-869
|
artikel
|
| 12 |
Projective splitting with forward steps
|
Johnstone, Patrick R.
|
|
|
191 |
2 |
p. 631-670
|
artikel
|
| 13 |
Sparse PSD approximation of the PSD cone
|
Blekherman, Grigoriy
|
|
|
191 |
2 |
p. 981-1004
|
artikel
|
| 14 |
Stochastic Lipschitz dynamic programming
|
Ahmed, Shabbir
|
|
|
191 |
2 |
p. 755-793
|
artikel
|
| 15 |
The generalized trust region subproblem: solution complexity and convex hull results
|
Wang, Alex L.
|
|
|
191 |
2 |
p. 445-486
|
artikel
|
Tijdschrift beschrijving