Name
Abstract | ||
|---|---|---|
Nondominated sorting is a fundamental combinatorial problem in multiobjective optimization and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work [SIAM J. Math. Anal., 46 ( 2014), pp. 603-638], we showed that nondominated sorting has a continuum limit that corresponds to solving a Hamilton-Jacobi equation. In this work we present and analyze a fast numerical scheme for this Hamilton-Jacobi equation and show how it can be used to design a fast algorithm for approximate nondominated sorting. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1137/130940657 | SIAM JOURNAL ON NUMERICAL ANALYSIS |
Keywords | Field | DocType |
Hamilton-Jacobi equations,numerical schemes,algorithms,viscosity solutions,longest chain in Euclidean space,nondominated sorting,Pareto-optimality | Mathematical optimization,Multi-objective optimization,Sorting,Mathematics | Journal |
Volume | Issue | ISSN |
53 | 1 | 0036-1429 |
Citations | PageRank | References |
2 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeff Calder | 1 | 65 | 11.47 |
| Selim Esedoglu | 2 | 1000 | 49.59 |
| Alfred O. Hero III | 3 | 2600 | 301.12 |