Near-optimal discrete optimization for experimental design: a regret minimization approach.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 439, doi. 10.1007/s10107-019-01464-2
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2021 AND VI 186 AND IP 1/2
Results: 15
1
2
An O(n2logn) algorithm for the weighted stable set problem in claw-free graphs.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 409, doi. 10.1007/s10107-019-01461-5
- By:
- Publication type:
- Article
3
Stronger MIP formulations for the Steiner forest problem.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 373, doi. 10.1007/s10107-019-01460-6
- By:
- Publication type:
- Article
4
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 337, doi. 10.1007/s10107-019-01457-1
- By:
- Publication type:
- Article
5
On sparsity of the solution to a random quadratic optimization problem.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 309, doi. 10.1007/s10107-019-01456-2
- By:
- Publication type:
- Article
6
The salesman's improved tours for fundamental classes.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 289, doi. 10.1007/s10107-019-01455-3
- By:
- Publication type:
- Article
7
On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 257, doi. 10.1007/s10107-019-01454-4
- By:
- Publication type:
- Article
8
Exploiting partial correlations in distributionally robust optimization.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 209, doi. 10.1007/s10107-019-01453-5
- By:
- Publication type:
- Article
9
Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 185, doi. 10.1007/s10107-019-01452-6
- By:
- Publication type:
- Article
10
Implementable tensor methods in unconstrained convex optimization.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 157, doi. 10.1007/s10107-019-01449-1
- By:
- Publication type:
- Article
11
Nonnegative rank depends on the field.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 479, doi. 10.1007/s10107-019-01448-2
- By:
- Publication type:
- Article
12
On distributionally robust chance constrained programs with Wasserstein distance.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 115, doi. 10.1007/s10107-019-01445-5
- By:
- Publication type:
- Article
13
Hypergraph k-cut in randomized polynomial time.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 85, doi. 10.1007/s10107-019-01443-7
- By:
- Publication type:
- Article
14
Why random reshuffling beats stochastic gradient descent.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 49, doi. 10.1007/s10107-019-01440-w
- By:
- Publication type:
- Article
15
Amenable cones: error bounds without constraint qualifications.
- Published in:
- Mathematical Programming, 2021, v. 186, n. 1/2, p. 1, doi. 10.1007/s10107-019-01439-3
- By:
- Publication type:
- Article