BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jamie Haddock (UCLA)
DTSTART:20210527T160000Z
DTEND:20210527T163000Z
DTSTAMP:20260414T235838Z
UID:MIP2021/30
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/MIP2021/30/"
 >The Minimum Euclidean-Norm Point on a Convex Polytope: Wolfe's Combinator
 ial Algorithm is Exponential</a>\nby Jamie Haddock (UCLA) as part of Mixed
  Integer Programming Workshop 2021\n\n\nAbstract\nThe complexity of Philip
  Wolfe's method for the minimum Euclidean-norm point problem over a convex
  polytope has remained unknown since he proposed the method in 1974. The m
 ethod is important because it is used as a subroutine for one of the most 
 practical algorithms for submodular function minimization. We present the 
 first example that Wolfe's method takes exponential time. Additionally\, w
 e improve previous results to show that linear programming reduces in stro
 ngly-polynomial time to the minimum norm point problem over a simplex.\n
LOCATION:https://researchseminars.org/talk/MIP2021/30/
END:VEVENT
END:VCALENDAR