Related papers: Rates of convergence for the continuum limit of no…
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…
We show that non-dominated sorting of a sequence of i.i.d. random variables in Euclidean space has a continuum limit that corresponds to solving a Hamilton-Jacobi equation involving the probability density function of the random variables.…
We investigate high-order finite difference schemes for the Hamilton-Jacobi equation continuum limit of nondominated sorting. Nondominated sorting is an algorithm for sorting points in Euclidean space into layers by repeatedly removing…
Non-dominated 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, we…
Nondominated sorting arranges a set of points in Euclidean space into layers by repeatedly removing the coordinatewise minimal elements. It was recently shown that nondominated sorting of random points has a Hamilton-Jacobi equation…
In this paper, we establish the higher order convergence rates in periodic homogenization of viscous Hamilton-Jacobi equations, which is convex and grows quadratically in the gradient variable. We observe that although the nonlinear…
We present a proof of qualitative stochastic homogenization for a nonconvex Hamilton-Jacobi equation. The new idea is to introduce a family of "sub-equations" and to control solutions of the original equation by the maximal subsolutions of…
Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton-Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex…
We prove rate of convergence results for singular perturbations of Hamilton-Jacobi equations in unbounded spaces where the fast operator is linear, uniformly elliptic and has an Ornstein-Uhlenbeck-type drift. The slow operator is a fully…
We prove explicit estimates for the error in random homogenization of degenerate, second-order Hamilton-Jacobi equations, assuming the coefficients satisfy a finite range of dependence. In particular, we obtain an algebraic rate of…
We prove precise rates of convergence for monotone approximation schemes of fractional and nonlocal Hamilton-Jacobi-Bellman (HJB) equations. We consider diffusion corrected difference-quadrature schemes from the literature and new…
Non-dominated sorting is a computational bottleneck in Pareto-based multi-objective evolutionary algorithms (MOEAs) due to the runtime-intensive comparison operations involved in establishing dominance relationships between solution…
We study random homogenization of second-order, degenerate and quasilinear Hamilton-Jacobi equations which are positively homogeneous in the gradient. Included are the equations of forced mean curvature motion and others describing…
In this article we study a finite horizon optimal control problem with monotone controls. We consider the associated Hamilton-Jacobi-Bellman (HJB) equation which characterizes the value function. We consider the totally discretized problem…
We consider the homogenization of monotone systems of viscous Hamilton-Jacobi equations with convex nonlinearities set in the stationary, ergodic setting. The primary focus of this paper is on collapsing systems which, as the microscopic…
Pareto hull peeling is a discrete algorithm, generalizing convex hull peeling, for sorting points in Euclidean space. We prove that Pareto peeling of a random point set in two dimensions has a scaling limit described by a first-order…
A classical problem in ergodic continuous time control consists of studying the limit behavior of the optimal value of a discounted cost functional with infinite horizon as the discount factor $\lambda$ tends to zero. In the literature,…
Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small…
Here, we study quantitative homogenization of first-order convex Hamilton-Jacobi equations with $(u/\varepsilon)$-periodic Hamiltonians which typically appear in dislocation dynamics. Firstly, we establish the optimal convergence rate by…
We present stochastic homogenization results for viscous Hamilton-Jacobi equations using a new argument which is based only on the subadditive structure of maximal subsolutions (solutions of the "metric problem"). This permits us to give…