BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/445
DTSTAMP:20230914T125924Z
SUMMARY:Interior Point Methods (as seen by Renegar)
DESCRIPTION:Speaker: Amit Deshpande (Microsoft Research India\n#9\, Lavelle
  Road\nBangalore 560025)\n\nAbstract: \nAbstract: Interior point methods o
 r IPMs are a class of iterative algorithms in optimization that follow an 
 interior path (unlike the simplex method which follows the boundary). Von 
 Neumann proposed an IPM for linear programming (LP) way back in 1948. Late
 r IPMs were generalized for convex optimization\, before their reappearanc
 e as fast LP solvers with Karmarkar's algorithm. Subsequently\, Nesterov-N
 emirovskii proved fast convergence of IPMs for convex optimization using "
 self-concordant barrier" functions.\nIn his book\, Renegar revisits this v
 ery creative but mysterious work of Nesterov-Nemirovskii\, and tries to de
 mystify it from a mathematical viewpoint. I will try to explain this appro
 ach in my talk. The talk will be self-contained and assume only basic know
 ledge of linear algebra and vector calculus.\n
URL:https://www.tcs.tifr.res.in/web/events/445
DTSTART;TZID=Asia/Kolkata:20140117T143000
DTEND;TZID=Asia/Kolkata:20140117T160000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR