Tight Semidefinite Programming Relaxations for Polynomial Optimization

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


Duration: 42:29
661 views
14

Jiawang Nie (UC San Diego)
https://simons.berkeley.edu/talks/tight-semidefinite-programming-relations-polynomial-optimization
Hyperbolic Polynomials and Hyperbolic Programming



Other Videos By Simons Institute for the Theory of Computing


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
2019-05-01Discrete Optimization using Log-Concave Polynomials
2019-04-30Volumes of Sublevel Sets of Homogeneous Polynomials
2019-04-30Tight Semidefinite Programming Relaxations for Polynomial Optimization
2019-04-30First-Order Methods and Hyperbolic Programming
2019-04-30Primal-Dual Algorithms for Hyperbolic Programming Problems
2019-04-30Certificates of Polynomial Non-Negativity via Hyperbolic Optimization
2019-04-13Privacy Challenges in Machine Learning
2019-04-13Forensics and Zero Knowledge
2019-04-13Lattice-Based Zero Knowledge and Applications
2019-04-13Classical Zero Knowledge Arguments for Quantum Computing
2019-04-13Algorand: The Truly Distributed Ledger
2019-04-13From Zero Knowledge to Private Transactions
2019-04-12A Necessary and Sufficient Stability Notion for Adaptive Generalization


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