AMS Short Course on Sum of Squares will be held on January 14-15, 2019 before the Joint Mathematics Meetings in Baltimore, MD

Event Details
  • Date/Time:
    • Monday January 14, 2019 - Tuesday January 15, 2019
      All Day
  • Location: Joint Mathematics Meetings in Baltimore, MD
  • Phone:
  • URL: Sum of Squares: Theory and Applications
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: SCMB Researcher, Grigoriy Blekherman, will give an overview of SOS polynomials

Full Summary: No summary paragraph submitted.

Media
  • Greg Blekherman, associate professor, Mathematics Greg Blekherman, associate professor, Mathematics
    (image/jpeg)

Overview of SOS polynomials

Grigoriy Blekherman, Georgia Institute of Technology.

Nonnegativity of polynomials and its relations with sums of squares are classical topics in real algebraic geometry. This area has a rich and distinguished mathematical history beginning with Hilbert's fundamental work, his 17th problem, and its solution by Artin. Work in this area involves a blend of ideas and techniques from algebraic geometry, convex geometry and optimization. Recently SOS algorithms and relaxations have found numerous applications in engineering and theoretical computer science. There is also an emergent understanding that the study of nonnegative and SOS polynomials on a variety is inextricably linked to classical topics in algebraic geometry and commutative algebra, such as minimal free resolutions.

This exciting blend of ideas can be demonstrated with a single prominent example: the cone of positive semidefinite (PSD) matrices. On the one hand this cone can be viewed as the set of all homogeneous quadratic polynomials (forms) nonnegative on all of R^n, while on the other hand it is also a convex cone in the vector space of real symmetric matrices. It is also known that quadratic forms nonnegative on R^n are always SOS. An affine linear slice of the PSD cone is called a spectrahedron. The object of semidefinite programming is optimization of a linear function over a spectrahedron, and it is the engine that makes SOS algorithms work. SOS algorithms naturally lead to spectrahedra via convex duality, and understanding algebraic and convexity properties of these spectrahedra is the key to understanding the quality of these algorithms.

Additional Information

In Campus Calendar
No
Groups

Southeast Center for Mathematics and Biology (SCMB)

Invited Audience
Public
Categories
Conference/Symposium
Keywords
course
Status
  • Created By: ftaylor9
  • Workflow Status: Published
  • Created On: Oct 4, 2018 - 12:43pm
  • Last Updated: Oct 4, 2018 - 3:01pm