Conference Agenda
Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
|
|
|
Session Overview | |
|
Location: Unitobler, F022 104 seats, 126m^2 |
| Date: Tuesday, 09/Jul/2019 | |
| 10:00am - 12:00pm |
Room free Location: Unitobler, F022 |
| 3:00pm - 5:00pm |
MS195, part 1: Algebraic methods for convex sets Location: Unitobler, F022 Algebraic methods for convex sets (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) The slack variety of a polytope Spectrahedral representations of polar orbitopes Sums of squares and quadratic persistence Semialgebraic Vision |
| Date: Wednesday, 10/Jul/2019 | |
| 10:00am - 12:00pm |
MS130, part 1: Polynomial optimization and its applications Location: Unitobler, F022 Polynomial optimization and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) The Geometry of SDP-Exactness in Quadratic Optimization Semidefinite representations of the set of separable states Noncommutative polynomial optimization and quantum graph parameters On Convexity of Polynomials over a Box |
| 3:00pm - 5:00pm |
MS195, part 2: Algebraic methods for convex sets Location: Unitobler, F022 Algebraic methods for convex sets (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Determinantal representations of stable and hyperbolic polynomials Noncommutative polynomials describing convex sets Semidefinite Programming and Nash Equilibria in Bimatrix Games Low Rank Tensor Methods in High Dimensional Data Analysis |
| Date: Thursday, 11/Jul/2019 | |
| 10:00am - 12:00pm |
MS130, part 2: Polynomial optimization and its applications Location: Unitobler, F022 Polynomial optimization and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Moments and convex optimization for analysis and control of nonlinear partial differential equations Two-player games between polynomial optimizers and semidefinite solvers. A Generalization of SAGE Certificates for Constrained Optimization On positive duality gaps in semidefinite programming |
| 3:00pm - 5:00pm |
MS195, part 3: Algebraic methods for convex sets Location: Unitobler, F022 Algebraic methods for convex sets (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Average-Case Algorithm Design Using Sum-of-Squares Fitting Semidefinite-Representable Sets to Support Function Evaluations Measuring Optimality Gap in Conic Programming Approximations with Gaussian Width False discovery and its control for low rank estimation |
| Date: Friday, 12/Jul/2019 | |
| 10:00am - 12:00pm |
MS130, part 3: Polynomial optimization and its applications Location: Unitobler, F022 Polynomial optimization and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Limitations on the expressive power of convex cones without long chains of faces On the exactness of Lasserre relaxations and pure states over real closed fields High-dimensional estimation via sum-of-squares proofs Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM ExponentialsLog-concave polynomials, entropy, and approximate counting |
| 3:00pm - 5:00pm |
MS129, part 1: Sparsity in polynomial systems and applications Location: Unitobler, F022 Sparsity in polynomial systems and applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Optimal Descartes' rule of signs for polynomial systems supported on circuits Polyhedral Approximations to the Cone of Nonnegative Polynomials Nonegativity and Discriminants Exploiting Sparsity for Semi-Algebraic Set Volume Computation |
| Date: Saturday, 13/Jul/2019 | |
| 10:00am - 12:00pm |
MS130, part 4: Polynomial optimization and its applications Location: Unitobler, F022 Polynomial optimization and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Tighter bounds through rank-one convexification Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs Phaseless rank Log-concave polynomials, entropy, and approximate counting |
| 3:00pm - 5:00pm |
MS129, part 2: Sparsity in polynomial systems and applications Location: Unitobler, F022 Sparsity in polynomial systems and applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Filling a much-needed gap in the literature Computing elimination ideals of likelihood equations Nonnegative polynomials and circuit polynomials An Experimental Classification of Maximal Mediated Sets |
