Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods.
- Published in:
- 2024
- By:
- Publication type:
- Correction Notice
Works matching IS 00255610 AND DT 2024 AND VI 208 AND IP 1/2
Results: 21
1
2
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 497, doi. 10.1007/s10107-023-02048-x
- By:
- Publication type:
- Article
3
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 661, doi. 10.1007/s10107-023-02053-0
- By:
- Publication type:
- Article
4
Deciding whether a lattice has an orthonormal basis is in co-NP.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 763, doi. 10.1007/s10107-023-02052-1
- By:
- Publication type:
- Article
5
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 629, doi. 10.1007/s10107-023-02051-2
- By:
- Publication type:
- Article
6
Adjustability in robust linear optimization.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 581, doi. 10.1007/s10107-023-02049-w
- By:
- Publication type:
- Article
7
Frank–Wolfe-type methods for a class of nonconvex inequality-constrained problems.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 717, doi. 10.1007/s10107-023-02055-y
- By:
- Publication type:
- Article
8
Constrained optimization of rank-one functions with indicator variables.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 533, doi. 10.1007/s10107-023-02047-y
- By:
- Publication type:
- Article
9
FPT algorithms for a special block-structured integer program with applications in scheduling.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 463, doi. 10.1007/s10107-023-02046-z
- By:
- Publication type:
- Article
10
Asymmetry in the complexity of the multi-commodity network pricing problem.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 425, doi. 10.1007/s10107-023-02043-2
- By:
- Publication type:
- Article
11
Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions".
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 411, doi. 10.1007/s10107-023-02042-3
- By:
- Publication type:
- Article
12
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 365, doi. 10.1007/s10107-023-02041-4
- By:
- Publication type:
- Article
13
Complementary composite minimization, small gradients in general norms, and applications.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 319, doi. 10.1007/s10107-023-02040-5
- By:
- Publication type:
- Article
14
Hardness and approximation of submodular minimum linear ordering problems.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 277, doi. 10.1007/s10107-023-02038-z
- By:
- Publication type:
- Article
15
The exact worst-case convergence rate of the alternating direction method of multipliers.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 243, doi. 10.1007/s10107-023-02037-0
- By:
- Publication type:
- Article
16
First order asymptotics of the sample average approximation method to solve risk averse stochastic programs.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 209, doi. 10.1007/s10107-023-02036-1
- By:
- Publication type:
- Article
17
A single cut proximal bundle method for stochastic convex composite optimization.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 173, doi. 10.1007/s10107-023-02035-2
- By:
- Publication type:
- Article
18
Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 111, doi. 10.1007/s10107-023-02033-4
- By:
- Publication type:
- Article
19
A general framework for multi-marginal optimal transport.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 75, doi. 10.1007/s10107-023-02032-5
- By:
- Publication type:
- Article
20
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 51, doi. 10.1007/s10107-023-02031-6
- By:
- Publication type:
- Article
21
Beyond symmetry: best submatrix selection for the sparse truncated SVD.
- Published in:
- Mathematical Programming, 2024, v. 208, n. 1/2, p. 1, doi. 10.1007/s10107-023-02030-7
- By:
- Publication type:
- Article