Related papers: A geometry-based relaxation algorithm for equilibr…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
A useful approach to the mathematical analysis of large-scale biological networks is based upon their decompositions into monotone dynamical systems. This paper deals with two computational problems associated to finding decompositions…
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…
We consider the multilinear polytope defined as the convex hull of the feasible region of a linearized binary polynomial optimization problem. We define a relaxation in an extended space for this polytope, which we refer to as the complete…
The embedding of the equations of polyconvex elastodynamics to an augmented symmetric hyperbolic system provides in conjunction with the relative entropy method a robust stability framework for approximate solutions. We devise here a model…
In this paper we establish a connection between non-convex optimization methods for training deep neural networks and nonlinear partial differential equations (PDEs). Relaxation techniques arising in statistical physics which have already…
In this paper we introduce and analyze an iteratively re-weighted algorithm, that allows to approximate the weak solution of the $p$-Poisson problem for $1 < p \leq 2$ by iteratively solving a sequence of linear elliptic problems. The…
We investigate the three-dimensional compressible Euler-Maxwell system, a model for simulating the transport of electrons interacting with propagating electromagnetic waves in semiconductor devices. First, we show the global well-posedness…
The incommensurate stacking of multi-layered two-dimensional materials is a challenging problem from a theoretical perspective and an intriguing avenue for manipulating their physical properties. Here we present a multi-scale model to…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
This report describes a modification of the orthogonal function Poisson solver for n-body simulations that minimizes relaxation caused by small particle number fluctuations. With the standard algorithm, the noise leading to relaxation can…
We study the relaxation of an elastic string in a two dimensional pinning landscape using Langevin dynamics simulations. The relaxation of a line, initially flat, is characterized by a growing length, $L(t)$, separating the equilibrated…
This article is the second of a three-part series that derives a self-consistent theoretical framework of the electromechanics of arbitrarily curved lipid membranes. Existing continuum theories commonly treat lipid membranes as strictly…
When two-dimensional van der Waals materials are stacked to build heterostructures, moir\'e patterns emerge from twisted interfaces or from mismatch in lattice constant of individual layers. Relaxation of the atomic positions is a direct,…
We study the relaxation dynamics of fully clustered networks (maximal number of triangles) to an unclustered state under two different edge dynamics---the double-edge swap, corresponding to degree-preserving randomization of the…
This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…
Voronoi diagrams appear in many areas in science and technology and have numerous applications. They have been the subject of extensive investigation during the last decades. Roughly speaking, they are a certain decomposition of a given…
In this paper we derive analytically the evolution equation of the interface for a model of surface growth with relaxation to the minimum (SRM) in complex networks. We were inspired by the disagreement between the scaling results of the…
We study Voronoi diagrams for distance functions that add together two convex functions, each taking as its argument the difference between Cartesian coordinates of two planar points. When the functions do not grow too quickly, then the…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…