Completely positive reformulations for polynomial optimization.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 405, doi. 10.1007/s10107-014-0822-9
- By:
- Publication type:
- Article
Works matching IS 00255610 AND DT 2015 AND VI 151 AND IP 2
Results: 13
1
2
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 433, doi. 10.1007/s10107-014-0825-6
- By:
- Publication type:
- Article
3
Certification of real inequalities: templates and sums of squares.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 477, doi. 10.1007/s10107-014-0834-5
- By:
- Publication type:
- Article
4
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 459, doi. 10.1007/s10107-014-0836-3
- By:
- Publication type:
- Article
5
Tractable approximations of sets defined with quantifiers.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 507, doi. 10.1007/s10107-014-0838-1
- By:
- Publication type:
- Article
6
A semidefinite programming hierarchy for packing problems in discrete geometry.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 529, doi. 10.1007/s10107-014-0843-4
- By:
- Publication type:
- Article
7
Quartic spectrahedra.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 585, doi. 10.1007/s10107-014-0844-3
- By:
- Publication type:
- Article
8
The hierarchy of local minimums in polynomial optimization.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 555, doi. 10.1007/s10107-014-0845-2
- By:
- Publication type:
- Article
9
Approximate cone factorizations and lifts of polytopes.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 613, doi. 10.1007/s10107-014-0848-z
- By:
- Publication type:
- Article
10
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 639, doi. 10.1007/s10107-015-0863-8
- By:
- Publication type:
- Article
11
Exploiting symmetry in copositive programs via semidefinite hierarchies.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 659, doi. 10.1007/s10107-015-0879-0
- By:
- Publication type:
- Article
12
The 2013 Newton Institute Programme on polynomial optimization.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
13
Semidefinite programming and eigenvalue bounds for the graph partition problem.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 379, doi. 10.1007/s10107-014-0817-6
- By:
- Publication type:
- Article