Title: Recent topics in complexity for nonconvex optimization problems
Abstract: The talk will review results on the evaluation complexity of algorithms for nonlinear (nonconvex) optimization problems. The focus is on unconstrained and “simply constrained” cases and will consider obtaining high-order optimality conditions. Algorithms using inexact information will also be covered.
The seminar will take place in room S08 at the Faculty of Sciences