nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A colorful Steinitz Lemma with application to block-structured integer programs
|
Oertel, Timm |
|
|
204 |
1-2 |
p. 677-702 |
artikel |
2 |
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2 submatrices
|
Iwamasa, Yuni |
|
|
204 |
1-2 |
p. 27-79 |
artikel |
3 |
A J-symmetric quasi-newton method for minimax problems
|
Asl, Azam |
|
|
204 |
1-2 |
p. 207-254 |
artikel |
4 |
Approximation algorithms for flexible graph connectivity
|
Boyd, Sylvia |
|
|
204 |
1-2 |
p. 493-516 |
artikel |
5 |
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
|
Dadush, Daniel |
|
|
204 |
1-2 |
p. 135-206 |
artikel |
6 |
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
|
Das Gupta, Shuvomoy |
|
|
204 |
1-2 |
p. 567-639 |
artikel |
7 |
Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
|
He, Ziyu |
|
|
204 |
1-2 |
p. 517-566 |
artikel |
8 |
Diverse collections in matroids and graphs
|
Fomin, Fedor V. |
|
|
204 |
1-2 |
p. 415-447 |
artikel |
9 |
FISTA is an automatic geometrically optimized algorithm for strongly convex functions
|
Aujol, J.-F. |
|
|
204 |
1-2 |
p. 449-491 |
artikel |
10 |
Geometry of vectorial martingale optimal transportations and duality
|
Lim, Tongseok |
|
|
204 |
1-2 |
p. 349-383 |
artikel |
11 |
Gradient regularization of Newton method with Bregman distances
|
Doikov, Nikita |
|
|
204 |
1-2 |
p. 1-25 |
artikel |
12 |
Hyperbolicity cones are amenable
|
Lourenço, Bruno F. |
|
|
204 |
1-2 |
p. 753-764 |
artikel |
13 |
Modeling combinatorial disjunctive constraints via junction trees
|
Lyu, Bochuan |
|
|
204 |
1-2 |
p. 385-413 |
artikel |
14 |
On the convex hull of convex quadratic optimization problems with indicators
|
Wei, Linchuan |
|
|
204 |
1-2 |
p. 703-737 |
artikel |
15 |
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
|
Boob, Digvijay |
|
|
204 |
1-2 |
p. 255-297 |
artikel |
16 |
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
|
Das Gupta, Shuvomoy |
|
|
204 |
1-2 |
p. 641 |
artikel |
17 |
Recognizing pinch-graphic matroids
|
Guenin, Bertrand |
|
|
204 |
1-2 |
p. 113-134 |
artikel |
18 |
Shapes and recession cones in mixed-integer convex representability
|
Zadik, Ilias |
|
|
204 |
1-2 |
p. 739-752 |
artikel |
19 |
Small separations in pinch-graphic matroids
|
Guenin, Bertrand |
|
|
204 |
1-2 |
p. 81-111 |
artikel |
20 |
Solving graph equipartition SDPs on an algebraic variety
|
Tang, Tianyun |
|
|
204 |
1-2 |
p. 299-347 |
artikel |
21 |
The maximum measure of non-trivial 3-wise intersecting families
|
Tokushige, Norihide |
|
|
204 |
1-2 |
p. 643-676 |
artikel |