Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 351, doi. 10.1007/s10107-020-01516-y
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2021 AND VI 188 AND IP 1
Results: 13
1
2
Strong formulations for conic quadratic optimization with indicator variables.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 193, doi. 10.1007/s10107-020-01508-y
- By:
- Publication type:
- Article
3
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 135, doi. 10.1007/s10107-020-01506-0
- By:
- Publication type:
- Article
4
Adaptive regularization with cubics on manifolds.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 85, doi. 10.1007/s10107-020-01505-1
- By:
- Publication type:
- Article
5
Separation routine and extended formulations for the stable set problem in claw-free graphs.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 53, doi. 10.1007/s10107-020-01502-4
- By:
- Publication type:
- Article
6
Correction to: Stronger MIP formulations for the Steiner forest problem.
- Published in:
- 2021
- By:
- Publication type:
- Correction Notice
7
Better and simpler error analysis of the Sinkhorn–Knopp algorithm for matrix scaling.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 395, doi. 10.1007/s10107-020-01503-3
- By:
- Publication type:
- Article
8
Box-total dual integrality, box-integrality, and equimodular matrices.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 319, doi. 10.1007/s10107-020-01514-0
- By:
- Publication type:
- Article
9
Maximum edge-disjoint paths in planar graphs with congestion 2.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 295, doi. 10.1007/s10107-020-01513-1
- By:
- Publication type:
- Article
10
The condition number of a function relative to a set.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 255, doi. 10.1007/s10107-020-01510-4
- By:
- Publication type:
- Article
11
Simple bilevel programming and extensions.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 227, doi. 10.1007/s10107-020-01509-x
- By:
- Publication type:
- Article
12
Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 19, doi. 10.1007/s10107-020-01501-5
- By:
- Publication type:
- Article
13
Complexity of packing common bases in matroids.
- Published in:
- Mathematical Programming, 2021, v. 188, n. 1, p. 1, doi. 10.1007/s10107-020-01497-y
- By:
- Publication type:
- Article