Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,900
Published on ● Video Link: https://www.youtube.com/watch?v=Emn6Mst5N10


Duration: 40:06
315 views
2

Nick Ryder (UC Berkeley)
https://simons.berkeley.edu/talks/exponential-lower-bounds-spectrahedral-representations-hyperbolicity-cones
Hyperbolic Polynomials and Hyperbolic Programming



Other Videos By Simons Institute for the Theory of Computing


2019-05-07Lattices: Algorithms, Complexity, and Cryptography
2019-05-07Foundations of Deep Learning
2019-05-07The Quantum Wave in Computing
2019-05-07Online and Matching-Based Market Design
2019-05-06Checks and Balances in Governance by AI
2019-05-06Optimal Privacy-Constrained Mechanisms
2019-05-06Getting AI to Forget About You: Data Deletion From Machine Learning Models
2019-05-06Societal Concerns in Targeted Advertising
2019-05-03Linear Preservers of Stable and Lorentzian Polynomials and Deformations of Hyperbolicity Cones
2019-05-03Kippenhahn's Theorem in Higher Dimensions
2019-05-03Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones
2019-05-03Constrained Subset Selection Problems under Diversity Measures
2019-05-02Your Dreams May Come True with MTP2
2019-05-02Formulas for Riesz Kernels
2019-05-02Positively Hyperbolic Varieties
2019-05-02Max Cut with Linear Programs: Sherali-Adams Strikes Back
2019-05-02Ehrhart Polynomials of Dilated Polytopes
2019-05-01An Interior-Point Method for Convex Optimization over Non-symmetric Cones
2019-05-01Optimization over the Hypercube via Sums of Nonnegative Circuit Polynomials
2019-05-01Combinatorial Characterizations in Semidefinite Programming Duality: ...
2019-05-01Completely Log-Concave Polynomials


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Hyperbolic Polynomials and Hyperbolic Programming
Nick Ryder