Invited Speakers
Titles and Abstracts
Mioara Joldes
CNRS, LAAS, France 
Validated numerics: algorithms and practical applications in aerospaceAbstract:
In various fields, ranging from aerospace engineering or robotics to computerassisted mathematical proofs, fast and precise computations are essential. Validated (sometimes called rigorous as well) computing is a relatively recent field, developed in the last 20 years, which uses numerical computations, yet is able to provide rigorous mathematical statements about the obtained result, such as guaranteed and reasonably tight error bounds. This area of research deals with problems that cannot or are difficult and costly in time to be solved by traditional mathematical methods, like problems that have a large search space, problems for which closed forms given by symbolic computations are not available or too difficult to obtain, or problems in nonlinear analysis.

Joris van der Hoeven
CNRS, LIX, France 
On the complexity of symbolic computationAbstract: How fast can we perform basic operations in symbolic computation and how does this impact the complexity for solving more elaborate problems? In our talk we will survey computer algebra from this complexity perspective, while considering both theoretical and practical aspects.

Avi Wigderson
Institute for Advance Study, Princeton, USA 
Noncommutative Optimization: where algebra, analysis and algorithms meetAbstract:
This talk aims to summarize a project I was involved in during the past 5 years, with the hope of explaining our most complete understanding so far, as well as challenges and open problems. The main messages of this project are summarized below; I plan to describe, through examples, many of the concepts they refer to, and the evolution of ideas leading to them. No special background is assumed.
