### Philippe Toint (University of Namur, Belgium)

#### How much patience do you have? Complexity issues in nonlinear optimization

*Joint work with Coralia Cartis and Nick Gould.*

*Thursday 10 December 2015 at 15.00, Swann Building 7.15*

##### Abstract

The talk will give a broad outline of the recent advances in worst-case
evaluation complexity for the nonlinear (possibly nonconvex) optimization
problem. Worst-case bounds will be given for the unconstrained, convexly
constrained and general constrained problems, and examples will be shown to
prove the sharpness of these bounds. Besides the already remarkable fact that
such bounds exist, the analysis brings several surprises related to the impact
of constraints on complexity and the worst-case performance of well-known
algorithms such as Newton's method.

### Seminars by year

*Current*
*2016*
*2015*
*2014*
*2013*
*2012*
*2011*
*2010*
*2009*
*2008*
*2007*
*2006*
*2005*
*2004*
*2003*
*2002*
*2001*
*2000*
*1999*
*1998*
*1997*
*1996*