Pablo Parrilo
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| LP/SDP Hierarchies and Sum of Squares Proofs 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Explains that nonnegativity checks reduce to semidefinite programming by writing a polynomial as a quadratic form over a chosen monomial basis and searching… | ||
| LP/SDP Hierarchies and Sum of Squares Proofs 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Real infeasibility certificates appear as an f + g = -1 certificate with f in the ideal of equations and g in the cone generated by inequalities; bounding the… | ||
| LP/SDP Hierarchies and Sum of Squares Proofs 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Part three shows an SOS/SDP proof that a triangle-free graph has at most asymptotically half the possible edges (an SOS version of Mantel’s theorem), by… | ||
| LP/SDP Hierarchies and Sum of Squares Proofs 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Presents a concrete SOS-based algorithm: a quasi-polynomial time N^{O(log N / ε^2)} method that approximates the max of a degree‑4 polynomial (M defined as… | ||
| Chordal Structure and Polynomial Systems | Solving Polynomial Equations (Simons Institute, 2014) | 2014-10-13 |
Proposes a chordal elimination algorithm that preserves sparsity by eliminating variables along a perfect elimination order, computes elimination ideals for… | ||
| Semidefinite Hierarchies in Quantum Information | Quantum Games and Protocols | 2014-02-24 |
Semidefinite hierarchies convert hard nonnegativity and separability checks into tractable sum of squares and SDP feasibility problems by representing… | ||
| nothing matches | ||