Related papers: The Selection problem for discounted Hamilton-Jaco…
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…
We study the homogenization of first-order Hamilton-Jacobi equations on an infinite-dimensional Hilbert space, motivated by systems of infinitely many indistinguishable particles on the torus. A central difficulty is that the analysis takes…
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…
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…
Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but…
This paper is devoted to study the vanishing contact structure problem which is a generalization of the vanishing discount problem. Let $H^\lambda(x,p,u)$ be a family of Hamiltonians of contact type with parameter $\lambda>0$ and converges…
We study discounted Hamilton Jacobi equations on networks, without putting any restriction on their geometry. Assuming the Hamiltonians continuous and coercive, we establish a comparison principle and provide representation formulae for…
We study Hamilton-Jacobi equations on networks in the case where Hamiltonians are quasi-convex with respect to the gradient variable and can be discontinuous with respect to the space variable at vertices. First, we prove that imposing a…
In this paper, we prove the stochastic homogenization of certain nonconvex Hamilton-Jacobi equations. The nonconvex Hamiltonians, which are generally uneven and inseparable, are generated by a sequence of quasiconvex Hamiltonians and a…
We study the well-posedness of an infinite-dimensional Hamilton-Jacobi equation posed on the set of non-negative measures and with a monotonic non-linearity. Our results will be used in a companion work to propose a conjecture and prove…
The equivalence between logarithmic Sobolev inequalities and hypercontractivity of solutions of Hamilton-Jacobi equations has been proved in [5]. We consider a semi-Lagrangian approximation scheme for the Hamilton-Jacobi equation and we…
The Hamilton-Jacobi-Bellman equation arising from the optimal portfolio selection problem is studied by means of the maximal monotone operator method. The existence and uniqueness of a solution to the Cauchy problem for the nonlinear…
This paper is the first attempt to systematically study properties of the effective Hamiltonian $\overline{H}$ arising in the periodic homogenization of some coercive but nonconvex Hamilton-Jacobi equations. Firstly, we introduce a new and…
We study Hamilton-Jacobi equations in [0, +$\infty$) of evolution type with nonlinear boundary conditions of Neumann type in the case where the Hamiltonian is non necessarily convex with respect to the gradient variable. In this paper, we…
We obtain new quantitative estimates of the vanishing viscosity approximation for time-dependent, degenerate, Hamilton-Jacobi equations that are neither concave nor convex in the gradient and Hessian entries of the form $\partial_t…
We provide a general result concerning the homogenization of nonconvex viscous Hamilton-Jacobi equations in the stationary, ergodic setting. In particular, we show that homogenization occurs for a non-empty set of points within every level…
We propose a novel formulation for approximating reachable sets through a minimum discounted reward optimal control problem. The formulation yields a continuous solution that can be obtained by solving a Hamilton-Jacobi equation.…
We study the convergence rates of policy iteration (PI) for nonconvex viscous Hamilton--Jacobi equations using a discrete space-time scheme, where both space and time variables are discretized. We analyze the case with an uncontrolled…
Many imaging problems can be formulated as inverse problems expressed as finite-dimensional optimization problems. These optimization problems generally consist of minimizing the sum of a data fidelity and regularization terms. In [23,26],…
We propose an optimization algorithm called Frictionless Hamiltonian Descent, which is a direct counterpart of classical Hamiltonian Monte Carlo in sampling. We analyze Frictionless Hamiltonian Descent for strongly convex quadratic…