Workshops

Spring 2019

Hyperbolic Polynomials and Hyperbolic Programming

Apr. 30 – May 3, 2019

Return to event »

Click on the titles of individual talks for abstract, slides and archived video.

Tuesday, April 30th, 2019
9:00 am – 9:20 am		Coffee and Check-in
9:20 am – 9:30 am		Opening Remarks
9:30 am – 10:15 am		Certificates of Polynomial Non-Negativity via Hyperbolic Optimization James Saunderson (Monash University)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Primal-Dual Algorithms for Hyperbolic Programming Problems Levent Tuncel (University of Waterloo)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		First-Order Methods and Hyperbolic Programming James Renegar (Cornell University)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Tight Semidefinite Programming Relaxations for Polynomial Optimization Jiawang Nie (UC San Diego)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		Volumes of Sublevel Sets of Homogeneous Polynomials Jean-Bernard Lasserre (LAAS-CNRS)
4:15 pm – 4:30 pm		Questions/Discussion
4:30 pm – 6:00 pm		Reception

Wednesday, May 1st, 2019
9:00 am – 9:30 am		Coffee and Check-in
9:30 am – 10:15 am		Discrete Optimization using Log-Concave Polynomials Nima Anari (Stanford University)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Completely Log-Concave Polynomials Cynthia Vinzant (North Carolina State University)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Combinatorial Characterizations in Semidefinite Programming Duality: How Elementary Row Operations Help Gabor Pataki (University of North Carolina at Chapel Hill)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Optimization over the Hypercube via Sums of Nonnegative Circuit Polynomials Mareike Dressler (UC San Diego)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		An Interior-Point Method for Convex Optimization over Non-symmetric Cones Dávid Papp (North Carolina State University)
4:15 pm – 4:30 pm		Questions/Discussion

Thursday, May 2nd, 2019
9:00 am – 9:30 am		Coffee and Check-in
9:30 am – 10:15 am		Ehrhart Polynomials of Dilated Polytopes Katharina Victoria Jochemko (KTH Royal Institute of Technology)
10:15 am – 10:30 am		Questions/Discussion
10:30 am – 11:15 am		Max Cut with Linear Programs: Sherali-Adams Strikes Back Tselil Schramm (Harvard & MIT)
11:15 am – 11:30 am		Questions/Discussion
11:30 am – 11:45 am		Break
11:45 am – 12:30 pm		Positively Hyperbolic Varieties Josephine Yu (Georgia Institute of Technology)
12:30 pm – 12:45 pm		Questions/Discussion
12:45 pm – 2:15 pm		Lunch
2:15 pm – 3:00 pm		Formulas for Riesz Kernels Khazhgali Kozhasov (Max Planck Institute for Mathematics in the Sciences)
3:00 pm – 3:15 pm		Questions/Discussion
3:15 pm – 3:30 pm		Break
3:30 pm – 4:15 pm		Your Dreams May Come True with MTP2 Caroline Uhler (Massachusetts Institute of Technology)
4:15 pm – 4:30 pm		Questions/Discussion

Friday, May 3rd, 2019
8:30 am – 9:00 am		Coffee and Check-in
9:00 am – 9:45 am		Constrained Subset Selection Problems under Diversity Measures Mohit Singh (Georgia Institute of Technology)
9:45 am – 10:00 am		Questions/Discussion
10:00 am – 10:45 am		Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones Nick Ryder (UC Berkeley)
10:45 am – 11:00 am		Questions/Discussion
11:00 am – 11:15 am		Break
11:15 am – 12:00 pm		Kippenhahn's Theorem in Higher Dimensions Daniel Plaumann (TU Dortmund University)
12:00 pm – 12:15 pm		Questions/Discussion
12:15 pm – 1:00 pm		Linear Preservers of Stable and Lorentzian Polynomials and Deformations of Hyperbolicity Cones Petter Brändén (KTH Royal Institute of Technology)
1:00 pm – 1:15 pm		Questions/Discussion