Exact formulas for the proximal/regular/limiting normal cone of the second-order cone complementarity set.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 33, doi. 10.1007/s10107-016-1027-1
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2017 AND VI 162 AND IP 1/2
Results: 20
1
2
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 51, doi. 10.1007/s10107-016-1029-z
- By:
- Publication type:
- Article
3
Minimizing finite sums with the stochastic average gradient.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 83, doi. 10.1007/s10107-016-1030-6
- By:
- Publication type:
- Article
4
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 523, doi. 10.1007/s10107-016-1031-5
- By:
- Publication type:
- Article
5
Quadratic reformulations of nonlinear binary optimization problems.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 115, doi. 10.1007/s10107-016-1032-4
- By:
- Publication type:
- Article
6
Maximizing a class of submodular utility functions with constraints.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 145, doi. 10.1007/s10107-016-1033-3
- By:
- Publication type:
- Article
7
On the linear convergence of the alternating direction method of multipliers.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 165, doi. 10.1007/s10107-016-1034-2
- By:
- Publication type:
- Article
8
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 201, doi. 10.1007/s10107-016-1035-1
- By:
- Publication type:
- Article
9
Mixed-integer quadratic programming is in NP.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 225, doi. 10.1007/s10107-016-1036-0
- By:
- Publication type:
- Article
10
Graph cuts with interacting edge weights: examples, approximations, and algorithms.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 241, doi. 10.1007/s10107-016-1038-y
- By:
- Publication type:
- Article
11
An axiomatic duality framework for the theta body and related convex corners.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 283, doi. 10.1007/s10107-016-1041-3
- By:
- Publication type:
- Article
12
Finding a low-rank basis in a matrix subspace.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 325, doi. 10.1007/s10107-016-1042-2
- By:
- Publication type:
- Article
13
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 363, doi. 10.1007/s10107-016-1043-1
- By:
- Publication type:
- Article
14
How to convexify the intersection of a second order cone and a nonconvex quadratic.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 393, doi. 10.1007/s10107-016-1045-z
- By:
- Publication type:
- Article
15
A note on alternating projections for ill-posed semidefinite feasibility problems.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 537, doi. 10.1007/s10107-016-1048-9
- By:
- Publication type:
- Article
16
Linear conic formulations for two-party correlations and values of nonlocal games.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 431, doi. 10.1007/s10107-016-1049-8
- By:
- Publication type:
- Article
17
The worst case analysis of strong knapsack facets.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 465, doi. 10.1007/s10107-016-1050-2
- By:
- Publication type:
- Article
18
Erratum to: Minimizing finite sums with the stochastic average gradient.
- Published in:
- 2017
- By:
- Publication type:
- Erratum
19
Some upper and lower bounds on PSD-rank.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 495, doi. 10.1007/s10107-016-1052-0
- By:
- Publication type:
- Article
20
A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ for nonconvex optimization.
- Published in:
- Mathematical Programming, 2017, v. 162, n. 1/2, p. 1, doi. 10.1007/s10107-016-1026-2
- By:
- Publication type:
- Article