Efficiency of minimizing compositions of convex functions and smooth maps.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 503, doi. 10.1007/s10107-018-1311-3
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2019 AND VI 178 AND IP 1/2
Results: 15
1
2
Submodular optimization views on the random assignment problem.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 485, doi. 10.1007/s10107-018-1310-4
- By:
- Publication type:
- Article
3
A decomposition method for MINLPs with Lipschitz continuous nonlinearities.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 449, doi. 10.1007/s10107-018-1309-x
- By:
- Publication type:
- Article
4
On cutting planes for cardinality-constrained linear programs.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 417, doi. 10.1007/s10107-018-1306-0
- By:
- Publication type:
- Article
5
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 381, doi. 10.1007/s10107-018-1300-6
- By:
- Publication type:
- Article
6
"Facet" separation with one linear program.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 361, doi. 10.1007/s10107-018-1299-8
- By:
- Publication type:
- Article
7
Oracle complexity of second-order methods for smooth convex optimization.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 327, doi. 10.1007/s10107-018-1293-1
- By:
- Publication type:
- Article
8
A general double-proximal gradient algorithm for d.c. programming.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 301, doi. 10.1007/s10107-018-1292-2
- By:
- Publication type:
- Article
9
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 263, doi. 10.1007/s10107-018-1290-4
- By:
- Publication type:
- Article
10
Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 215, doi. 10.1007/s10107-018-1285-1
- By:
- Publication type:
- Article
11
Generalized self-concordant functions: a recipe for Newton-type methods.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 145, doi. 10.1007/s10107-018-1282-4
- By:
- Publication type:
- Article
12
An inexact dual logarithmic barrier method for solving sparse semidefinite programs.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 109, doi. 10.1007/s10107-018-1281-5
- By:
- Publication type:
- Article
13
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 69, doi. 10.1007/s10107-018-1278-0
- By:
- Publication type:
- Article
14
Optimization problems involving group sparsity terms.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 39, doi. 10.1007/s10107-018-1277-1
- By:
- Publication type:
- Article
15
Tight relaxations for polynomial optimization and Lagrange multiplier expressions.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 1, doi. 10.1007/s10107-018-1276-2
- By:
- Publication type:
- Article