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
 
3:00pm - 5:00pm

Algebraic methods for convex sets

Chair(s): Rainer Sinn (Freie Universität Berlin, Germany), Greg Blekherman (Georgia Institute of Technology), Daniel Plaumann (Technische Universität Dortmund), Yong Sheng Soh (Institute of High Performance Computing, Singapore), Dogyoon Song (Massachusetts Institute of Technology)

 

(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

Antonio Macchia
Freie Universität Berlin

 

Spectrahedral representations of polar orbitopes

Claus Scheiderer
Universität Konstanz

 

Sums of squares and quadratic persistence

Gregory G. Smith
Queen's University

 

Semialgebraic Vision

Rekha Thomas
University of Washington, Seattle


Date: Wednesday, 10/Jul/2019
10:00am
-
12:00pm
MS130, part 1: Polynomial optimization and its applications
Location: Unitobler, F022
 
10:00am - 12:00pm

Polynomial optimization and its applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Simone Naldi (Université de Limoges, France), João Gouveia (Universidade de Coimbra, Portugal)

 

(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

Diego Cifuentes1, Corey Harris2, Bernd Sturmfels3
1MIT, Cambridge, MA, USA, 2University of Oslo, Norway, 3MPI Leipzig, Germany

 

Semidefinite representations of the set of separable states

Hamza Fawzi
Cambridge University, United Kingdom

 

Noncommutative polynomial optimization and quantum graph parameters

Sander Gribling1, David de Laat2, Monique Laurent1
1CWI, Amsterdam, The Netherlands, 2Emory University, Atlanta, GA, USA

 

On Convexity of Polynomials over a Box

Georgina Hall1, Amir Ali Ahmadi2, Mihaela Curmei3
1INSEAD, Paris, France, 2Princeton University, NJ, USA, 3Microsoft

3:00pm
-
5:00pm
MS195, part 2: Algebraic methods for convex sets
Location: Unitobler, F022
 
3:00pm - 5:00pm

Algebraic methods for convex sets

Chair(s): Rainer Sinn (Freie Universität Berlin, Germany), Greg Blekherman (Georgia Institute of Technology), Daniel Plaumann (Technische Universität Dortmund), Yong Sheng Soh (Institute of High Performance Computing, Singapore), Dogyoon Song (Massachusetts Institute of Technology)

 

(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

Victor Vinnikov
Ben Gurion University of the Negev

 

Noncommutative polynomials describing convex sets

Jurij Volcic
Texas A&M University

 

Semidefinite Programming and Nash Equilibria in Bimatrix Games

Jeffrey Zhang
Princeton University

 

Low Rank Tensor Methods in High Dimensional Data Analysis

Ming Yuan
Columbia University


Date: Thursday, 11/Jul/2019
10:00am
-
12:00pm
MS130, part 2: Polynomial optimization and its applications
Location: Unitobler, F022
 
10:00am - 12:00pm

Polynomial optimization and its applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Simone Naldi (Université de Limoges, France), João Gouveia (Universidade de Coimbra, Portugal)

 

(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

Milan Korda, Didier Henrion, Jean-Bernard Lasserre
CNRS-LAAS, Toulouse, France

 

Two-player games between polynomial optimizers and semidefinite solvers.

Victor Magron1, Mohab Safey El Din2, Jean-Bernard Lasserre1
1CNRS-LAAS, Toulouse, France, 2Sorbonne Université, Paris, France

 

A Generalization of SAGE Certificates for Constrained Optimization

Riley Murray, Venkat Chandrasekaran
Caltech, Los Angeles, CA, USA

 

On positive duality gaps in semidefinite programming

Gabor Pataki
University of North Carolina at Chapel Hill, NC, USA

3:00pm
-
5:00pm
MS195, part 3: Algebraic methods for convex sets
Location: Unitobler, F022
 
3:00pm - 5:00pm

Algebraic methods for convex sets

Chair(s): Rainer Sinn (Freie Universität Berlin, Germany), Greg Blekherman (Georgia Institute of Technology), Daniel Plaumann (Technische Universität Dortmund), Yong Sheng Soh (Institute of High Performance Computing, Singapore), Dogyoon Song (Massachusetts Institute of Technology)

 

(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

Pravesh Kothari
Princeton University

 

Fitting Semidefinite-Representable Sets to Support Function Evaluations

Yong Sheng Soh
Institute of High Performance Computing, Singapore

 

Measuring Optimality Gap in Conic Programming Approximations with Gaussian Width

Dogyoon Song
Massachusetts Institute of Technology

 

False discovery and its control for low rank estimation

Armeen Taeb
California Institute of Technology


Date: Friday, 12/Jul/2019
10:00am
-
12:00pm
MS130, part 3: Polynomial optimization and its applications
Location: Unitobler, F022
 
10:00am - 12:00pm

Polynomial optimization and its applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Simone Naldi (Université de Limoges, France), João Gouveia (Universidade de Coimbra, Portugal)

 

(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

James Saunderson
Monash University, Melbourne, Australia

 

On the exactness of Lasserre relaxations and pure states over real closed fields

Markus Schweighofer1, Tom-Lukas Kriel2
1Universität Konstanz, Germany, 2TNG Technology Consulting GmbH

 

High-dimensional estimation via sum-of-squares proofs

David Steurer1, Prasad Raghavendra2, Tselil Schramm3
1ETH Zürich, Switzerland, 2University of California, Berkeley, CA, USA, 3MIT, Cambridge, MA, USA

 

Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM ExponentialsLog-concave polynomials, entropy, and approximate counting

Henning Seidler1, Victor Magron2, Timo de Wolff1
1Technische Universität Berlin, Germany, 2CNRS-LAAS, Toulouse, France

3:00pm
-
5:00pm
MS129, part 1: Sparsity in polynomial systems and applications
Location: Unitobler, F022
 
3:00pm - 5:00pm

Sparsity in polynomial systems and applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Mareike Dressler (University of California, San Diego)

 

(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

Frédéric Bihan1, Alicia Dickenstein2, Jens Forsgaard3
1Université Savoie Mont Blanc, France, 2Universidad de Buenos Aires, Argentina, 3Universiteit Utrecht, The Netherlands

 

Polyhedral Approximations to the Cone of Nonnegative Polynomials

Alperen Ergür
Technische Universität Berlin, Germany

 

Nonegativity and Discriminants

Jens Forsgaard1, Timo de Wolff2
1Universiteit Utrecht, The Netherlands, 2Technische Universität Berlin, Germany

 

Exploiting Sparsity for Semi-Algebraic Set Volume Computation

Jean-Bernard Lasserre1, Matteo Tacchi1, Tillmann Weisser2, Didier Henrion1
1CNRS-LAAS, Toulouse, France, 2Los Alamos National Lab, NM, USA


Date: Saturday, 13/Jul/2019
10:00am
-
12:00pm
MS130, part 4: Polynomial optimization and its applications
Location: Unitobler, F022
 
10:00am - 12:00pm

Polynomial optimization and its applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Simone Naldi (Université de Limoges, France), João Gouveia (Universidade de Coimbra, Portugal)

 

(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

Tillmann Weisser1, Sidhant Misra2, Hassan Hijzai2
1Los Alamos National Lab, NM, USA, 2Los Alamos National Laboratory, Los Alamos, NM, USA

 

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs

Yuzixuan Zhu, Pataki Gabor, Tran-Dinh Quoc
University of North Carolina at Chapel Hill, NC, USA

 

Phaseless rank

António Goucha1, João Gouveia2
1Universidade de Coimbra, 2Universidade de Coimbra, Portugal

 

Log-concave polynomials, entropy, and approximate counting

Cynthia Vinzant1, Nima Anari2, Kuikui Liu3, Shayan Oveis Gharan3
1North Carolina State University, NC, USA, 2Stanford University, CA, USA, 3University of Washington, Seattle, WA, USA

3:00pm
-
5:00pm
MS129, part 2: Sparsity in polynomial systems and applications
Location: Unitobler, F022
 
3:00pm - 5:00pm

Sparsity in polynomial systems and applications

Chair(s): Timo de Wolff (Technische Universität Berlin, Germany), Mareike Dressler (University of California, San Diego, CA, USA)

 

(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

Bruce Reznick
University of Illinois Urbana-Champaign, IL, USA

 

Computing elimination ideals of likelihood equations

Xiaoxian Tang1, Timo de Wolff2, Rukai Zhao1
1Texas A&M University, TX, USA, 2Technische Universität Berlin, Germany

 

Nonnegative polynomials and circuit polynomials

Jie Wang
Peking University, China

 

An Experimental Classification of Maximal Mediated Sets

Oguzhan Yürük, Timo de Wolff, Olivia Röhrig
Technische Universität Berlin, Germany