Works matching IS 00255610 AND DT 2020 AND VI 184 AND IP 1/2
Results: 15
Certifiably optimal sparse inverse covariance estimation.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 491, doi. 10.1007/s10107-019-01419-7
- By:
- Publication type:
- Article
Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 445, doi. 10.1007/s10107-019-01418-8
- By:
- Publication type:
- Article
A tight 2-approximation for linear 3-cut.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 411, doi. 10.1007/s10107-019-01417-9
- By:
- Publication type:
- Article
Golden ratio algorithms for variational inequalities.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 383, doi. 10.1007/s10107-019-01416-w
- By:
- Publication type:
- Article
Applying FISTA to optimization problems (with or) without minimizers.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 349, doi. 10.1007/s10107-019-01415-x
- By:
- Publication type:
- Article
Asynchronous level bundle methods.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 319, doi. 10.1007/s10107-019-01414-y
- By:
- Publication type:
- Article
Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 289, doi. 10.1007/s10107-019-01413-z
- By:
- Publication type:
- Article
Convergence of a relaxed inertial proximal algorithm for maximally monotone operators.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 243, doi. 10.1007/s10107-019-01412-0
- By:
- Publication type:
- Article
On the complexity of testing attainment of the optimal value in nonlinear optimization.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 221, doi. 10.1007/s10107-019-01411-1
- By:
- Publication type:
- Article
Efficient first-order methods for convex minimization: a constructive approach.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 183, doi. 10.1007/s10107-019-01410-2
- By:
- Publication type:
- Article
Online covering with ℓq-norm objectives and applications to network design.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 155, doi. 10.1007/s10107-019-01409-9
- By:
- Publication type:
- Article
Asynchronous parallel algorithms for nonconvex optimization.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 121, doi. 10.1007/s10107-019-01408-w
- By:
- Publication type:
- Article
Lower bounds for finding stationary points I.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 71, doi. 10.1007/s10107-019-01406-y
- By:
- Publication type:
- Article
Newton-type methods for non-convex optimization under inexact Hessian information.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 35, doi. 10.1007/s10107-019-01405-z
- By:
- Publication type:
- Article
Combinatorial n-fold integer programming and applications.
- Published in:
- Mathematical Programming, 2020, v. 184, n. 1/2, p. 1, doi. 10.1007/s10107-019-01402-2
- By:
- Publication type:
- Article