| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adjustability in robust linear optimization
|
Wei, Ningji
|
|
|
208 |
1-2 |
p. 581-628
|
article
|
| 2 |
A general framework for multi-marginal optimal transport
|
Pass, Brendan
|
|
|
208 |
1-2 |
p. 75-110
|
article
|
| 3 |
A single cut proximal bundle method for stochastic convex composite optimization
|
Liang, Jiaming
|
|
|
208 |
1-2 |
p. 173-208
|
article
|
| 4 |
Asymmetry in the complexity of the multi-commodity network pricing problem
|
Bui, Quang Minh
|
|
|
208 |
1-2 |
p. 425-461
|
article
|
| 5 |
Beyond symmetry: best submatrix selection for the sparse truncated SVD
|
Li, Yongchun
|
|
|
208 |
1-2 |
p. 1-50
|
article
|
| 6 |
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
|
Briański, Marcin
|
|
|
208 |
1-2 |
p. 497-531
|
article
|
| 7 |
Complementary composite minimization, small gradients in general norms, and applications
|
Diakonikolas, Jelena
|
|
|
208 |
1-2 |
p. 319-363
|
article
|
| 8 |
Constrained optimization of rank-one functions with indicator variables
|
Shafiee, Soroosh
|
|
|
208 |
1-2 |
p. 533-579
|
article
|
| 9 |
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
|
Ahookhosh, Masoud
|
|
|
208 |
1-2 |
p. 409-410
|
article
|
| 10 |
Counterexample and an additional revealing poll step for a result of “analysis of direct searches for discontinuous functions”
|
Audet, Charles
|
|
|
208 |
1-2 |
p. 411-424
|
article
|
| 11 |
Deciding whether a lattice has an orthonormal basis is in co-NP
|
Hunkenschröder, Christoph
|
|
|
208 |
1-2 |
p. 763-775
|
article
|
| 12 |
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
|
Thomä, Simon
|
|
|
208 |
1-2 |
p. 661-716
|
article
|
| 13 |
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs
|
Krätschmer, Volker
|
|
|
208 |
1-2 |
p. 209-242
|
article
|
| 14 |
FPT algorithms for a special block-structured integer program with applications in scheduling
|
Chen, Hua
|
|
|
208 |
1-2 |
p. 463-496
|
article
|
| 15 |
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems
|
Zeng, Liaoyuan
|
|
|
208 |
1-2 |
p. 717-761
|
article
|
| 16 |
Hardness and approximation of submodular minimum linear ordering problems
|
Farhadi, Majid
|
|
|
208 |
1-2 |
p. 277-318
|
article
|
| 17 |
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
|
Ahookhosh, Masoud
|
|
|
208 |
1-2 |
p. 365-407
|
article
|
| 18 |
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
|
Tian, Lai
|
|
|
208 |
1-2 |
p. 51-74
|
article
|
| 19 |
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings
|
Rieger, Alon
|
|
|
208 |
1-2 |
p. 111-171
|
article
|
| 20 |
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization
|
Bin, Michelangelo
|
|
|
208 |
1-2 |
p. 629-660
|
article
|
| 21 |
The exact worst-case convergence rate of the alternating direction method of multipliers
|
Zamani, Moslem
|
|
|
208 |
1-2 |
p. 243-276
|
article
|
Journal description