{"id":101,"date":"2015-02-01T01:14:48","date_gmt":"2015-02-01T09:14:48","guid":{"rendered":"https:\/\/math.berkeley.edu\/wp\/apde\/?p=101"},"modified":"2015-02-01T01:14:48","modified_gmt":"2015-02-01T09:14:48","slug":"jeff-calder-february-2","status":"publish","type":"post","link":"https:\/\/wp.math.berkeley.edu\/apde\/2015\/02\/01\/jeff-calder-february-2\/","title":{"rendered":"Jeff Calder (February 2)"},"content":{"rendered":"<p>\t\t\t\tSpeaker: Jeff Calder (UC Berkeley)<\/p>\n<p>Title: A PDE-proof of the continuum limit of non-dominated sorting<\/p>\n<p>Abstract: Non-dominated sorting is a combinatorial problem that is fundamental in multi-objective optimization, which is ubiquitous in engineering and scientific contexts. The sorting can be viewed as arranging points in Euclidean space into layers according to a partial order. It is equivalent to several well-known problems in probability and combinatorics, including the longest chain problem, and polynuclear growth. Recently, we showed that non-dominated sorting of random points has a continuum limit that corresponds to solving a Hamilton-Jacobi equation in the viscosity sense. Our original proof was based on a continuum variational problem, for which the PDE is the associated Hamilton-Jacobi-Bellman equation. In this talk, I will sketch a new proof that avoids this variational interpretation, and uses only PDE techniques. The proof borrows ideas from the Barles-Souganidis framework for proving convergence of numerical schemes to viscosity solutions. As a result, it seems this proof is more robust, and we believe it can be applied to many other problems that do not have obvious underlying variational principles. I will finish the talk by briefly sketching some current problems of interest.\t\t<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Speaker: Jeff Calder (UC Berkeley) Title: A PDE-proof of the continuum limit of non-dominated sorting Abstract: Non-dominated sorting is a combinatorial problem that is fundamental in multi-objective optimization, which is ubiquitous in engineering and scientific contexts. The sorting can be viewed as arranging points in Euclidean space into layers according to a partial order. It [&hellip;]<\/p>\n","protected":false},"author":105,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-101","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/posts\/101","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/users\/105"}],"replies":[{"embeddable":true,"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/comments?post=101"}],"version-history":[{"count":0,"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/posts\/101\/revisions"}],"wp:attachment":[{"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/media?parent=101"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/categories?post=101"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/wp.math.berkeley.edu\/apde\/wp-json\/wp\/v2\/tags?post=101"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}