Lopsided convergence: an extension and its quantification.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 395, doi. 10.1007/s10107-018-1275-3
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2019 AND VI 177 AND IP 1/2
Results: 15
1
2
Characterizations of mixed binary convex quadratic representable sets.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 371, doi. 10.1007/s10107-018-1274-4
- By:
- Publication type:
- Article
3
An algorithm for nonsmooth optimization by successive piecewise linearization.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 343, doi. 10.1007/s10107-018-1273-5
- By:
- Publication type:
- Article
4
On the existence of Pareto solutions for polynomial vector optimization problems.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 321, doi. 10.1007/s10107-018-1271-7
- By:
- Publication type:
- Article
5
Beating the 2-approximation factor for global bicut.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 291, doi. 10.1007/s10107-018-1270-8
- By:
- Publication type:
- Article
6
Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 255, doi. 10.1007/s10107-018-1266-4
- By:
- Publication type:
- Article
7
A new use of Douglas–Rachford splitting for identifying infeasible, unbounded, and pathological conic programs.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 225, doi. 10.1007/s10107-018-1265-5
- By:
- Publication type:
- Article
8
Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 173, doi. 10.1007/s10107-018-1264-6
- By:
- Publication type:
- Article
9
Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 149, doi. 10.1007/s10107-018-1263-7
- By:
- Publication type:
- Article
10
Exploiting problem structure in optimization under uncertainty via online convex optimization.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 113, doi. 10.1007/s10107-018-1262-8
- By:
- Publication type:
- Article
11
Improved local convergence results for augmented Lagrangian methods in C2-cone reducible constrained optimization.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 425, doi. 10.1007/s10107-018-1261-9
- By:
- Publication type:
- Article
12
Exact and approximation algorithms for weighted matroid intersection.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 85, doi. 10.1007/s10107-018-1260-x
- By:
- Publication type:
- Article
13
The ordered k-median problem: surrogate models and approximation algorithms.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 55, doi. 10.1007/s10107-018-1259-3
- By:
- Publication type:
- Article
14
Small and strong formulations for unions of convex sets from the Cayley embedding.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 21, doi. 10.1007/s10107-018-1258-4
- By:
- Publication type:
- Article
15
Partitioning a graph into small pieces with applications to path transversal.
- Published in:
- Mathematical Programming, 2019, v. 177, n. 1/2, p. 1, doi. 10.1007/s10107-018-1255-7
- By:
- Publication type:
- Article