Related papers: Nonasymptotic and asymptotic linear convergence of…
We present a dissipative algorithm for solving nonlinear wave-like equations when the initial data is specified on characteristic surfaces. The dissipative properties built in this algorithm make it particularly useful when studying the…
A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…
We provide a quantitative version of a result due to Poffald and Reich on the asymptotic behavior of solutions of a second-order Cauchy problem generated by an accretive operator in the form of a rate of convergence. This quantitative…
In this paper, we propose a $W$-cycle $p$-multigrid method for solving the $p$-version symmetric interior penalty discontinuous Galerkin (SIPDG) discretization of elliptic problems. This SIPDG discretization employs hierarchical Legendre…
Decentralized non-convex optimization is important in many problems of practical relevance. Existing decentralized methods, however, typically either lack convergence guarantees for general non-convex problems, or they suffer from a high…
We investigate the asymptotic symmetries of Rindler space at null infinity and at the event horizon using both systematic and ad hoc methods. We find that the approaches that yield infinite-dimensional asymptotic symmetry algebras in the…
We study spherically symmetric solutions of semilinear wave equations in the case where the nonlinearity satisfies the null condition on extremal Reissner--Nordstrom black hole spacetimes. We show that solutions which arise from…
Given a finite metric space $(X\cup Y, \mathbf{d})$ the $k$-median problem is to find a set of $k$ centers $C\subseteq Y$ that minimizes $\sum_{p\in X} \min_{c\in C} \mathbf{d}(p,c)$. In general metrics, the best polynomial time algorithm…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
For the evolution of a compressible fluid in spherical symmetry on a Schwarzschild curved background, we design a class of well-balanced numerical algorithms with first-order or second-order of accuracy. We treat both the relativistic…
We propose a new asynchronous parallel block-descent algorithmic framework for the minimization of the sum of a smooth nonconvex function and a nonsmooth convex one, subject to both convex and nonconvex constraints. The proposed framework…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
A classical approach for solving discrete time nonlinear control on a finite horizon consists in repeatedly minimizing linear quadratic approximations of the original problem around current candidate solutions. While widely popular in many…
In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…
This paper reports on recent work to compute the asymptotic solution of a n-th order ordinary differential equation. Symbolic methods are used to compute the asymptotics over a large region. Application is made to the computation of the…
For a homogenization problem associated to a linear elliptic operator, we prove the existence of a distributional corrector and we find an approximation scheme for the homogenized coefficients. We also study the convergence rates in the…
In this work, we study a quasilinear elliptic problem involving the 1-laplacian operator, with a discontinuous, superlinear and subcritical nonlinearity involving the Heaviside function $H(\cdot - \beta)$. Our approach is based on an…
We show that asymptotically, completely asynchronous stochastic gradient procedures achieve optimal (even to constant factors) convergence rates for the solution of convex optimization problems under nearly the same conditions required for…
In this manuscript, we propose efficient stochastic semi-explicit symplectic schemes tailored for nonseparable stochastic Hamiltonian systems (SHSs). These semi-explicit symplectic schemes are constructed by introducing augmented…
The proximal algorithm is a powerful tool to minimize nonlinear and nonsmooth functionals in a general metric space. Motivated by the recent progress in studying the training dynamics of the noisy gradient descent algorithm on two-layer…