Rates of convergence for the continuum limit of nondominated sorting

From MaRDI portal



Abstract: Nondominated sorting is a discrete process that sorts points in Euclidean space according to the coordinatewise partial order, and is used to rank feasible solutions to multiobjective optimization problems. It was previously shown that nondominated sorting of random points has a Hamilton-Jacobi equation continuum limit. We prove quantitative error estimates for the convergence of nondominated sorting to its continuum limit Hamilton-Jacobi equation. Our proof uses the maximum principle and viscosity solution machinery, along with new semiconvexity estimates for domains with corner singularities.




Cites work



Describes a project that uses

Uses Software






This page was built for publication: Rates of convergence for the continuum limit of nondominated sorting

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