BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:How much patience do you have ? Complexity issues in nonlinear opt
 imization - Philippe Toint (The University of Namur)
DTSTART:20151127T150000Z
DTEND:20151127T160000Z
UID:TALK61363@talks.cam.ac.uk
CONTACT:Carola-Bibiane Schoenlieb
DESCRIPTION:The talk will give a broad outline of the recent advances in w
 orst-case evaluation complexity for the nonlinear (possibly nonconvex) opt
 imization problem.\nWorst-case bounds will be given for the unconstrained\
 , convexly constrained and general constrained problems\, and examples wil
 l be shown to prove the sharpness\nof these bounds.  Besides the already r
 emarkable fact that such bounds exist\, the analysis brings several surpri
 ses related to the impact of constraints on complexity and the worst-case 
 performance of well-known algorithms such as Newton's method.
LOCATION:MR 15\, CMS
END:VEVENT
END:VCALENDAR