Works matching IS 00255610 AND DT 2021 AND VI 185 AND IP 1/2
Results: 15
Worst-case complexity of cyclic coordinate descent: O(n2) gap with randomized version.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 487, doi. 10.1007/s10107-019-01437-5
- By:
- Publication type:
- Article
Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 455, doi. 10.1007/s10107-019-01435-7
- By:
- Publication type:
- Article
Distributionally robust polynomial chance-constraints under mixture ambiguity sets.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 409, doi. 10.1007/s10107-019-01434-8
- By:
- Publication type:
- Article
Multi-marginal maximal monotonicity and convex analysis.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 385, doi. 10.1007/s10107-019-01433-9
- By:
- Publication type:
- Article
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 357, doi. 10.1007/s10107-019-01432-w
- By:
- Publication type:
- Article
Lower bounds for finding stationary points II: first-order methods.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 315, doi. 10.1007/s10107-019-01431-x
- By:
- Publication type:
- Article
Facets from gadgets.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 297, doi. 10.1007/s10107-019-01430-y
- By:
- Publication type:
- Article
New polyhedral and algorithmic results on greedoids.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 275, doi. 10.1007/s10107-019-01427-7
- By:
- Publication type:
- Article
Shorter tours and longer detours: uniform covers and a bit beyond.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 245, doi. 10.1007/s10107-019-01426-8
- By:
- Publication type:
- Article
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 199, doi. 10.1007/s10107-019-01425-9
- By:
- Publication type:
- Article
Mixed-integer bilevel representability.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 163, doi. 10.1007/s10107-019-01424-w
- By:
- Publication type:
- Article
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 111, doi. 10.1007/s10107-019-01423-x
- By:
- Publication type:
- Article
A differentiable homotopy method to compute perfect equilibria.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 77, doi. 10.1007/s10107-019-01422-y
- By:
- Publication type:
- Article
Multidimensional sum-up rounding for integer programming in optimal experimental design.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 37, doi. 10.1007/s10107-019-01421-z
- By:
- Publication type:
- Article
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems.
- Published in:
- Mathematical Programming, 2021, v. 185, n. 1/2, p. 1, doi. 10.1007/s10107-019-01420-0
- By:
- Publication type:
- Article