Polynomial root radius optimization with affine constraints.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 509, doi. 10.1007/s10107-016-1092-5
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2017 AND VI 165 AND IP 2
Results: 9
1
2
An extended formulation of the convex recoloring problem on a tree.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 529, doi. 10.1007/s10107-016-1094-3
- By:
- Publication type:
- Article
3
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 549, doi. 10.1007/s10107-016-1095-2
- By:
- Publication type:
- Article
4
Revisiting k-sum optimization.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 579, doi. 10.1007/s10107-016-1096-1
- By:
- Publication type:
- Article
5
Probably certifiably correct k-means clustering.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 605, doi. 10.1007/s10107-016-1097-0
- By:
- Publication type:
- Article
6
Hirsch polytopes with exponentially long combinatorial segments.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 663, doi. 10.1007/s10107-016-1099-y
- By:
- Publication type:
- Article
7
A unified approach to error bounds for structured convex optimization problems.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 689, doi. 10.1007/s10107-016-1100-9
- By:
- Publication type:
- Article
8
From error bounds to the complexity of first-order descent methods for convex functions.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 471, doi. 10.1007/s10107-016-1091-6
- By:
- Publication type:
- Article
9
The matching problem has no small symmetric SDP.
- Published in:
- Mathematical Programming, 2017, v. 165, n. 2, p. 643, doi. 10.1007/s10107-016-1098-z
- By:
- Publication type:
- Article