nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A convergence analysis of the price of anarchy in atomic congestion games
|
Wu, Zijun |
|
|
199 |
1-2 |
p. 937-993 |
artikel |
2 |
An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians
|
Na, Sen |
|
|
199 |
1-2 |
p. 721-791 |
artikel |
3 |
Analysis of the Frank–Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
|
Zhao, Renbo |
|
|
199 |
1-2 |
p. 123-163 |
artikel |
4 |
An augmented Lagrangian method for optimization problems with structured geometric constraints
|
Jia, Xiaoxi |
|
|
199 |
1-2 |
p. 1365-1415 |
artikel |
5 |
An exponential lower bound for Zadeh’s pivot rule
|
Disser, Yann |
|
|
199 |
1-2 |
p. 865-936 |
artikel |
6 |
An optimal gradient method for smooth strongly convex minimization
|
Taylor, Adrien |
|
|
199 |
1-2 |
p. 557-594 |
artikel |
7 |
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
|
Rockafellar, R. Tyrrell |
|
|
199 |
1-2 |
p. 375-420 |
artikel |
8 |
Disjunctive cuts in Mixed-Integer Conic Optimization
|
Lodi, Andrea |
|
|
199 |
1-2 |
p. 671-719 |
artikel |
9 |
Exact computation of an error bound for the balanced linear complementarity problem with unique solution
|
Dussault, Jean-Pierre |
|
|
199 |
1-2 |
p. 1221-1238 |
artikel |
10 |
Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy
|
Levin, Eitan |
|
|
199 |
1-2 |
p. 831-864 |
artikel |
11 |
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
|
Hu, Shenglong |
|
|
199 |
1-2 |
p. 1305-1364 |
artikel |
12 |
Linear convergence of Frank–Wolfe for rank-one matrix recovery without strong convexity
|
Garber, Dan |
|
|
199 |
1-2 |
p. 87-121 |
artikel |
13 |
Lower bounds for non-convex stochastic optimization
|
Arjevani, Yossi |
|
|
199 |
1-2 |
p. 165-214 |
artikel |
14 |
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem
|
Zhang, Zeyang |
|
|
199 |
1-2 |
p. 639-669 |
artikel |
15 |
Node connectivity augmentation via iterative randomized rounding
|
Angelidakis, Haris |
|
|
199 |
1-2 |
p. 995-1031 |
artikel |
16 |
Optimal error bounds for non-expansive fixed-point iterations in normed spaces
|
Contreras, Juan Pablo |
|
|
199 |
1-2 |
p. 343-374 |
artikel |
17 |
Polynomial-time algorithms for multimarginal optimal transport problems with structure
|
Altschuler, Jason M. |
|
|
199 |
1-2 |
p. 1107-1178 |
artikel |
18 |
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
|
Okuno, Takayuki |
|
|
199 |
1-2 |
p. 251-303 |
artikel |
19 |
Probability maximization via Minkowski functionals: convex representations and tractable resolution
|
Bardakci, I. E. |
|
|
199 |
1-2 |
p. 595-637 |
artikel |
20 |
Riemannian Optimization via Frank-Wolfe Methods
|
Weber, Melanie |
|
|
199 |
1-2 |
p. 525-556 |
artikel |
21 |
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso
|
Oliveira, Roberto I. |
|
|
199 |
1-2 |
p. 49-86 |
artikel |
22 |
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints
|
Oliveira, Roberto I. |
|
|
199 |
1-2 |
p. 1-48 |
artikel |
23 |
Scalable subspace methods for derivative-free nonlinear least-squares optimization
|
Cartis, Coralia |
|
|
199 |
1-2 |
p. 461-524 |
artikel |
24 |
Semi-discrete optimal transport: hardness, regularization and numerical solution
|
Taşkesen, Bahar |
|
|
199 |
1-2 |
p. 1033-1106 |
artikel |
25 |
Solving sparse principal component analysis with global support
|
Dey, Santanu S. |
|
|
199 |
1-2 |
p. 421-459 |
artikel |
26 |
Subgradient ellipsoid method for nonsmooth convex problems
|
Rodomanov, Anton |
|
|
199 |
1-2 |
p. 305-341 |
artikel |
27 |
Sum of squares generalizations for conic sets
|
Kapelevich, Lea |
|
|
199 |
1-2 |
p. 1417-1429 |
artikel |
28 |
Tangencies and polynomial optimization
|
Phạm, Tiến-Sơn |
|
|
199 |
1-2 |
p. 1239-1272 |
artikel |
29 |
Towards explicit superlinear convergence rate for SR1
|
Ye, Haishan |
|
|
199 |
1-2 |
p. 1273-1303 |
artikel |
30 |
Unifying mirror descent and dual averaging
|
Juditsky, Anatoli |
|
|
199 |
1-2 |
p. 793-830 |
artikel |
31 |
Vertex downgrading to minimize connectivity
|
Aissi, Hassene |
|
|
199 |
1-2 |
p. 215-249 |
artikel |
32 |
Zeroth-order optimization with orthogonal random directions
|
Kozak, David |
|
|
199 |
1-2 |
p. 1179-1219 |
artikel |