相关论文: The Selection problem for discounted Hamilton-Jaco…
We show that if a Hamilton-Jacobi equation admits a differentiable solution whose gradient is Lipschitz, then this solution is the unique semi-concave weak solution. Our result does not rely on any convexity (nor concavity) assumptions on…
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…
We study a class of weakly coupled systems of Hamilton{Jacobi equations at the critical level. We associate to it a family of scalar discounted equation. Using control{theoretic tech- niques we construct an algorithm which allows obtaining…
In this paper, we study evolutive Hamilton Jacobi equations with Hamiltonians that are discontinuous in time, posed on a simple network consisting of two edges on the real line connected at a single junction. We introduce a notion of…
The geometric framework for the Hamilton-Jacobi theory developed in previous works is extended for multisymplectic first-order classical field theories. The Hamilton-Jacobi problem is stated for the Lagrangian and the Hamiltonian formalisms…
We use the adjoint methods to study the static Hamilton-Jacobi equations and to prove the speed of convergence for those equations. The main new ideas are to introduce adjoint equations corresponding to the formal linearizations of…
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…
We consider a Hamilton-Jacobi equation where the Hamiltonian is periodic in space and coercive and convex in momentum. Combining the representation formula from optimal control theory and a theorem of Alexander, originally proved in the…
Given a continuous Hamiltonian $H : (x,p,u) \mapsto H(x,p,u)$ defined on $ T^*M \times \mathbb R $, where $M$ is a closed connected manifold, we study viscosity solutions, $u_\lambda : M\to \mathbb R$, of discounted equations: $ H(x, d_x…
Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data. However, such a problem is difficult to solve since it is NP-hard. Existing solutions are primarily based on convex…
Recently, results regarding the Inverse Design problem for Conservation Laws and Hamilton-Jacobi equations with space-dependent convex fluxes were obtaine. More precisely, characterizations of attainable sets and the set of initialdata…
It is well known that when the nonlinearity is convex, the Hamilton-Jacobi PDE admits a unique semi-convex weak solution, which is the viscosity solution. In this paper, motivated by problems arising from spin glasses, we show that if the…
In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantageous in different…
The goal of this paper is to study the link between the solution to an Hamilton-Jacobi (HJ) equation and the solution to a Scalar Conservation Law (SCL) on a special network. When the equations are posed on the real axis, it is well known…
We consider the chance-constrained binary knapsack problem (CKP), where the item weights are independent and normally distributed. We introduce a continuous relaxation for the CKP, represented as a non-convex optimization problem, which we…
We discuss a class of time-dependent Hamilton-Jacobi equations, where an unknown function of time is intended to keep the maximum of the solution to the constant value 0. Our main result is that the full problem has a unique viscosity…
This paper presents a convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems that are non-convex in the input norm, which is a…
Policy iteration is a widely used technique to solve the Hamilton Jacobi Bellman (HJB) equation, which arises from nonlinear optimal feedback control theory. Its convergence analysis has attracted much attention in the unconstrained case.…
Non-convex optimization problems have multiple local optimal solutions. Non-convex optimization problems are commonly found in numerous applications. One of the methods recently proposed to efficiently explore multiple local optimal…
This paper presents a piecewise convexification method to approximate the whole approximate optimal solution set of non-convex optimization problems with box constraints. In the process of box division, we first classify the sub-boxes and…