Georgina Hall - LP, SOCP, and optimization-free approaches to sum of squares optimization, Feb 12

Published: 12/02/2018
Georgina Hall - LP, SOCP, and optimization-free approaches to sum of squares optimization, Feb 12
Source: EVENTS.BERKELEY.EDU

The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others. A number of breakthrough papers in the early 2000s showed that this problem, long thought to be intractable, could be solved by using sum of squares programmin

Read more
Related news
Comment