Phase recovery, MaxCut and complex semidefinite programming.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 47, doi. 10.1007/s10107-013-0738-9
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2015 AND VI 149 AND IP 1/2
Results: 16
1
2
Second-order characterizations of tilt stability with applications to nonlinear programming.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 83, doi. 10.1007/s10107-013-0739-8
- By:
- Publication type:
- Article
3
Intrinsic volumes of symmetric cones and applications in convex programming.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 105, doi. 10.1007/s10107-013-0740-2
- By:
- Publication type:
- Article
4
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 131, doi. 10.1007/s10107-013-0741-1
- By:
- Publication type:
- Article
5
Improved approximations for two-stage min-cut and shortest path problems under uncertainty.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 167, doi. 10.1007/s10107-013-0742-0
- By:
- Publication type:
- Article
6
A condition number theorem in convex programming.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 195, doi. 10.1007/s10107-014-0745-5
- By:
- Publication type:
- Article
7
Packing in generalized kernel systems: a framework that generalizes packing of branchings.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 209, doi. 10.1007/s10107-014-0746-4
- By:
- Publication type:
- Article
8
The trust region subproblem with non-intersecting linear constraints.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 253, doi. 10.1007/s10107-014-0749-1
- By:
- Publication type:
- Article
9
Deriving robust counterparts of nonlinear uncertain inequalities.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 265, doi. 10.1007/s10107-014-0750-8
- By:
- Publication type:
- Article
10
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 301, doi. 10.1007/s10107-014-0753-5
- By:
- Publication type:
- Article
11
A note on the condition numbers of convex sets.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 459, doi. 10.1007/s10107-014-0758-0
- By:
- Publication type:
- Article
12
Set intersection problems: supporting hyperplanes and quadratic programming.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 329, doi. 10.1007/s10107-014-0759-z
- By:
- Publication type:
- Article
13
Bulk-Robust combinatorial optimization.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 361, doi. 10.1007/s10107-014-0760-6
- By:
- Publication type:
- Article
14
Automatic Dantzig-Wolfe reformulation of mixed integer programs.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 391, doi. 10.1007/s10107-014-0761-5
- By:
- Publication type:
- Article
15
Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 1, doi. 10.1007/s10107-013-0737-x
- By:
- Publication type:
- Article
16
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning.
- Published in:
- Mathematical Programming, 2015, v. 149, n. 1/2, p. 425, doi. 10.1007/s10107-014-0762-4
- By:
- Publication type:
- Article