CMU Campus
Center for                           Nonlinear Analysis
CNA Home People Seminars Publications Workshops and Conferences CNA Working Groups CNA Comments Form Summer Schools Summer Undergraduate Institute PIRE Cooperation Graduate Topics Courses SIAM Chapter Seminar Positions Contact
CNA Seminar/Colloquium/Joint Pitt-CNA Colloquium
Jeff Calder
UC Berkeley
Title: Partial differential equation continuum limits for discrete sorting problems

Abstract: Many problems in science and engineering involve the sorting, or ordering, of large amounts of multi-variate data. A common sorting technique is to arrange the data into layers by repeatedly removing the set of extremal points. Different notions of extremality lead to different sorting algorithms. Two common examples are non-dominated sorting, and convex hull peeling, which are widely used in multi-objective optimization, machine learning, and robust statistics. In this talk, I will present a Hamilton-Jacobi equation continuum limit for nondominated sorting, and a conjectured partial differential equation (PDE) continuum limit for convex hull peeling. I will also present some new numerical schemes for the Hamilton-Jacobi equation, and show how to design very fast approximate sorting algorithms based on numerical solving the continuum PDE.

Recording: http://mm.math.cmu.edu/recordings/cna/jeff_calder_small.mp4
Date: Thursday, March 31, 2016
Time: 1:30 pm
Location: Wean Hall 7218
Submitted by:  Slepcev