Dutch Seminar on Optimization (online series) with Lucas Slot (CWI) and Juan José Maulén (Groningen)

The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. These lectures will be given by Lucas Slot (CWI) and Juan José Maulén (Groningen). The lecture by Lucas Slot is entitled "Degree bounds for positivity certificates and the polynomial kernel method" and the lecture by Juan José Maulén is entitled "Acceleration of fixed point algorithms via inertia". Please visit the seminar website for more information.
  • Dutch Seminar on Optimization (online series) with Lucas Slot (CWI) and Juan José Maulén (Groningen)
  • 2021-10-28T16:00:00+02:00
  • 2021-10-28T17:00:00+02:00
  • The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. These lectures will be given by Lucas Slot (CWI) and Juan José Maulén (Groningen). The lecture by Lucas Slot is entitled "Degree bounds for positivity certificates and the polynomial kernel method" and the lecture by Juan José Maulén is entitled "Acceleration of fixed point algorithms via inertia". Please visit the seminar website for more information.

The Dutch Seminar on Optimization is an initiative to bring together researchers from the Netherlands and beyond, with topics that are centered around Optimization in a broad sense. We would like to invite all researchers, especially also PhD students, who are working on related topics to join the events. 

Speakers:  Lucas Slot (CWI) and Juan José Maulén (RU Groningen)

Title of the talk of Lucas Slot: Degree bounds for positivity certificates and the polynomial kernel method
Abstract of the talk of Lucas Slot:
The classical Positvestellensaetze of Putinar and Schmuedgen state that the positivity of a polynomial f over a (compact) semialgebraic set S can be verified by expanding f as a conic combination of the polynomials that define S, using sums of squares of polynomials as coefficients. Recently, there has been an interest in proving bounds on the largest degree of the sum-of-squares coefficients involved in this expansion. Such bounds have direct implications for the convergence rate of Lasserre-type hierarchies for polynomial optimization. We present the polynomial kernel method for proving degree bounds on special sets S, which was first used in the case of the hypersphere by Fang and Fawzi.
We apply the PKM to additional sets, including the binary hypercube {-1, 1}^n, the unit box [-1, 1]^n and the unit ball.

This is based on joint work with Monique Laurent.
Arxiv link: https://arxiv.org/abs/2011.04027

Title of the talk of Juan José Maulén: Acceleration of fixed point algorithms via inertia
Abstract of the talk of Juan José Maulén:
In this talk, we will use the results about the convergence of inertial optimization algorithms, defined as fixed point iterations from a family of cocoercive operators. This result implies that exists inertial versions of the Primal-dual splitting algorithm proposed by Briceño and Roldan on 2019, and for the three-operator splitting scheme proposed by Davis and Yin on 2015. Both algorithms fit on the framework of optimization algorithms defined by cocoercive operators. The inertial versions obtained are tested in several numerical experiments, where  better performance with respect to the original algorithms can be observed.

 

The lecture will be given online. Please visit the website for more information and the zoom link.