A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting

From MaRDI portal
Publication:299237

DOI10.1016/J.NA.2016.03.023zbMATH Open1347.35080arXiv1508.01565OpenAlexW2963828685MaRDI QIDQ299237FDOQ299237

Jeff Calder

Publication date: 22 June 2016

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Abstract: Nondominated sorting is a combinatorial algorithm that sorts points in Euclidean space into layers according to a partial order. It was recently shown that nondominated sorting of random points has a Hamilton-Jacobi equation continuum limit. The original proof relies on a continuum variational problem. In this paper, we give a new proof using a direct verification argument that completely avoids the variational interpretation. We believe this proof is new in the homogenization literature, and may be generalized to apply to other stochastic homogenization problems for which there is no obvious underlying variational principle.


Full work available at URL: https://arxiv.org/abs/1508.01565




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299237)