Correction: Efficient Kirszbraun extension with applications to regression.
- Published in:
- 2024
- By:
- Publication type:
- Correction Notice
Works matching IS 00255610 AND DT 2024 AND VI 207 AND IP 1/2
Results: 21
1
2
A polynomial time algorithm for finding a minimum 4-partition of a submodular function.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 717, doi. 10.1007/s10107-023-02029-0
- By:
- Publication type:
- Article
3
New lower bounds on crossing numbers of Km,n from semidefinite programming.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 693, doi. 10.1007/s10107-023-02028-1
- By:
- Publication type:
- Article
4
State polynomials: positivity, optimization and nonlinear Bell inequalities.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 645, doi. 10.1007/s10107-023-02024-5
- By:
- Publication type:
- Article
5
Efficient Kirszbraun extension with applications to regression.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 617, doi. 10.1007/s10107-023-02023-6
- By:
- Publication type:
- Article
6
Relaxations and duality for multiobjective integer programming.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 577, doi. 10.1007/s10107-023-02022-7
- By:
- Publication type:
- Article
7
Global stability of first-order methods for coercive tame functions.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 551, doi. 10.1007/s10107-023-02020-9
- By:
- Publication type:
- Article
8
Better-than-43-approximations for leaf-to-leaf tree and connectivity augmentation.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 515, doi. 10.1007/s10107-023-02018-3
- By:
- Publication type:
- Article
9
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 457, doi. 10.1007/s10107-023-02017-4
- By:
- Publication type:
- Article
10
Multiplicative updates for symmetric-cone factorizations.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 427, doi. 10.1007/s10107-023-02015-6
- By:
- Publication type:
- Article
11
Residuals-based distributionally robust optimization with covariate information.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 369, doi. 10.1007/s10107-023-02014-7
- By:
- Publication type:
- Article
12
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 329, doi. 10.1007/s10107-023-02013-8
- By:
- Publication type:
- Article
13
The density of planar sets avoiding unit distances.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 303, doi. 10.1007/s10107-023-02012-9
- By:
- Publication type:
- Article
14
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 269, doi. 10.1007/s10107-023-02009-4
- By:
- Publication type:
- Article
15
A new complexity metric for nonconvex rank-one generalized matrix completion.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 227, doi. 10.1007/s10107-023-02008-5
- By:
- Publication type:
- Article
16
Scalable adaptive cubic regularization methods.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 191, doi. 10.1007/s10107-023-02007-6
- By:
- Publication type:
- Article
17
Stochastic algorithms with geometric step decay converge linearly on sharp functions.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 145, doi. 10.1007/s10107-023-02003-w
- By:
- Publication type:
- Article
18
Short-step methods are not strongly polynomial-time.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 733, doi. 10.1007/s10107-023-02002-x
- By:
- Publication type:
- Article
19
Complexity of a projected Newton-CG method for optimization with bounds.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 107, doi. 10.1007/s10107-023-02000-z
- By:
- Publication type:
- Article
20
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 55, doi. 10.1007/s10107-023-01999-5
- By:
- Publication type:
- Article
21
Optimal gradient tracking for decentralized optimization.
- Published in:
- Mathematical Programming, 2024, v. 207, n. 1/2, p. 1, doi. 10.1007/s10107-023-01997-7
- By:
- Publication type:
- Article