Related papers: Hamilton-Jacobi equations for finite-rank matrix i…
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…
We study continuous dependence estimates for viscous Hamilton- Jacobi equations defined on a network Gamma. Given two Hamilton-Jacobi equations, we prove an estimate of the C2-norm of the difference between the corresponding solutions in…
In this paper, we study the general problem of optimizing a convex function $F(L)$ over the set of $p \times p$ matrices, subject to rank constraints on $L$. However, existing first-order methods for solving such problems either are too…
We develop a quantum algorithm for estimating the free energy as well as the total Gibbs state of interacting quantum Coulomb gases and molecular systems in dimensions $d \in \{2,3\}$ at finite temperature. These systems lie beyond the…
This paper studies the low-rank matrix completion problem from an information theoretic perspective. The completion problem is rephrased as a communication problem of an (uncoded) low-rank matrix source over an erasure channel. The paper…
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of…
We consider the problem of computing safety regions, modeled as nonconvex backward reachable sets, for a nonlinear car collision avoidance model with time-dependent obstacles. The Hamilton-Jacobi-Bellman framework is used. A new formulation…
The Hamilton-Jacobi formalism for fermionic systems is studied. We derive the HJ equations from the canonical transformation procedure, taking into account the second class constraints typical of these systems. It is shown that these…
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
In this work, we propose a numerical method based on high degree continuous nodal elements for the Cahn-Hilliard evolution. The use of the p-version of the finite element method proves to be very efficient and favorably compares with other…
We prove that the solution of the discounted approximation of a degenerate viscous Hamilton--Jacobi equation with convex Hamiltonians converges to that of the associated ergodic problem. We characterize the limit in terms of stochastic…
The proposed method of the free energy calculation is based on the approximation of the energy distribution in the microcanonical ensemble by the Gaussian distribution. We hope that our approach will be effective for the systems with…
For non convex Hamiltonians, the viscosity solution and the more geometric minimax solution of the Hamilton-Jacobi equation do not coincide in general. They are nevertheless related: we show that iterating the minimax procedure during…
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
For a convex, coercive continuous Hamiltonian on a compact closed Riemannian manifold $M$, we construct a unique forward weak KAM solution of \[ H(x, d_x u)=c(H) \] by a vanishing discount approach, where $c(H)$ is the Ma\~n\'e critical…
We address the noncommutative version of the Edmonds' problem, which asks to determine the inner rank of a matrix in noncommuting variables. We provide an algorithm for the calculation of this inner rank by relating the problem with the…
We survey the main numerical techniques for finite-dimensional nonlinear optimal control. The chapter is written as a guide to practitioners who wish to get rapidly acquainted with the main numerical methods used to efficiently solve an…
We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…
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…
In this short note we investigate the numerical performance of the method of artificial diffusion for second-order fully nonlinear Hamilton-Jacobi-Bellman equations. The method was proposed in (M. Jensen and I. Smears, arxiv:1111.5423);…