Become an AI & ML Engineer with Cal Poly EPaCE — IBM-Certified Training
Get 20% off all career paths from fullstack to AI
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore the cutting-edge advancements in polynomial optimization through this comprehensive conference talk on difference-of-sums-of-squares (D-SOS) and difference-of-convex-sums-of-squares (DC-SOS) decompositions. Delve into these natural extensions of Hilbert's 17th problem, gaining insights into the intrinsic algebraic structures of polynomials. Discover how these techniques provide robust frameworks for tackling complex large-scale polynomial optimization problems within the difference-of-convex (DC) optimization paradigm. Engage with open questions presented to stimulate further research and development in this dynamic field. Learn about the evolving landscape of polynomial optimization and its modern techniques over the course of this one-hour presentation.
Syllabus
Yishuai Niu: Difference of Sums-of-Squares Decompositions for Polynomials #ICBS2024
Taught by
BIMSA