Hyperbolic Polynomials and Hyperbolic Programming

Program

Geometry of Polynomials

Location

Calvin Lab auditorium

Date

Tuesday, Apr. 30 – Friday, May 3, 2019

Back to calendar

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

9 – 9:20 a.m.

Coffee and Check-in

9:20 – 9:30 a.m.

Opening Remarks

9:30 – 10:15 a.m.

Certificates of Polynomial Non-Negativity via Hyperbolic Optimization

James Saunderson (Monash University)

10:15 – 10:30 a.m.

Questions/Discussion

10:30 – 11:15 a.m.

Primal-Dual Algorithms for Hyperbolic Programming Problems

Levent Tuncel (University of Waterloo)

11:15 – 11:30 a.m.

Questions/Discussion

11:30 – 11:45 a.m.

Break

11:45 a.m. – 12:30 p.m.

First-Order Methods and Hyperbolic Programming

James Renegar (Cornell University)

12:30 – 12:45 p.m.

Questions/Discussion

12:45 – 2:15 p.m.

Lunch

2:15 – 3 p.m.

Tight Semidefinite Programming Relaxations for Polynomial Optimization

Jiawang Nie (UC San Diego)

3 – 3:15 p.m.

Questions/Discussion

3:15 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

Volumes of Sublevel Sets of Homogeneous Polynomials

Jean-Bernard Lasserre (LAAS-CNRS, Toulouse)

4:15 – 4:30 p.m.

Questions/Discussion

4:30 – 6 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:15 a.m.

Discrete Optimization using Log-Concave Polynomials

Nima Anari (Stanford University)

10:15 – 10:30 a.m.

Questions/Discussion

10:30 – 11:15 a.m.

Completely Log-Concave Polynomials

Cynthia Vinzant (North Carolina State University)

11:15 – 11:30 a.m.

Questions/Discussion

11:30 – 11:45 a.m.

Break

11:45 a.m. – 12:30 p.m.

Combinatorial Characterizations in Semidefinite Programming Duality: How Elementary Row Operations Help

Gabor Pataki (University of North Carolina at Chapel Hill)

12:30 – 12:45 p.m.

Questions/Discussion

12:45 – 2:15 p.m.

Lunch

2:15 – 3 p.m.

Optimization over the Hypercube via Sums of Nonnegative Circuit Polynomials

Mareike Dressler (UC San Diego)

3 – 3:15 p.m.

Questions/Discussion

3:15 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

An Interior-Point Method for Convex Optimization over Non-symmetric Cones

Dávid Papp (North Carolina State University)

4:15 – 4:30 p.m.

Questions/Discussion

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:15 a.m.

Ehrhart Polynomials of Dilated Polytopes

Katharina Victoria Jochemko (KTH Royal Institute of Technology)

10:15 – 10:30 a.m.

Questions/Discussion

10:30 – 11:15 a.m.

Max Cut with Linear Programs: Sherali-Adams Strikes Back

Tselil Schramm (Harvard & MIT)

11:15 – 11:30 a.m.

Questions/Discussion

11:30 – 11:45 a.m.

Break

11:45 a.m. – 12:30 p.m.

Positively Hyperbolic Varieties

Josephine Yu (Georgia Institute of Technology)

12:30 – 12:45 p.m.

Questions/Discussion

12:45 – 2:15 p.m.

Lunch

2:15 – 3 p.m.

Formulas for Riesz Kernels

Khazhgali Kozhasov (Max Planck Institute for Mathematics in the Sciences)

3 – 3:15 p.m.

Questions/Discussion

3:15 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

Your Dreams May Come True with MTP2

Caroline Uhler (Massachusetts Institute of Technology)

4:15 – 4:30 p.m.

Questions/Discussion

8:30 – 9 a.m.

Coffee and Check-in

9 – 9:45 a.m.

Constrained Subset Selection Problems under Diversity Measures

Mohit Singh (Georgia Institute of Technology)

9:45 – 10 a.m.

Questions/Discussion

10 – 10:45 a.m.

Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones

Nick Ryder (UC Berkeley)

10:45 – 11 a.m.

Questions/Discussion

11 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Kippenhahn's Theorem in Higher Dimensions

Daniel Plaumann (TU Dortmund University)

12 – 12:15 p.m.

Questions/Discussion

12:15 – 1 p.m.

Linear Preservers of Stable and Lorentzian Polynomials and Deformations of Hyperbolicity Cones

Petter Brändén (KTH Royal Institute of Technology in Stockholm)

1 – 1:15 p.m.

Questions/Discussion