Related papers: A Relaxed Ka\v{c}anov Iteration for the $p$-Poisso…
Weighted low rank approximation (WLRA) is an important yet computationally challenging primitive with applications ranging from statistical analysis, model compression, and signal processing. To cope with the NP-hardness of this problem,…
Lagrangian relaxation and approximate optimization algorithms have received much attention in the last two decades. Typically, the running time of these methods to obtain a $\epsilon$ approximate solution is proportional to…
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained L1 minimization. In this paper, we…
Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in…
Motivated by economic dispatch and linearly-constrained resource allocation problems, this paper proposes a novel Distributed Approx-Newton algorithm that approximates the standard Newton optimization method. A main property of this…
We introduce a relax-and-round approach embedding the quantum approximate optimization algorithm (QAOA) with $p\geq 1$ layers. We show for many problems, including Sherrington-Kirkpatrick spin glasses, that at $p=1$, it is as accurate as…
This paper presents a weakly intrusive strategy for computing a low-rank approximation of the solution of a system of nonlinear parameter-dependent equations. The proposed strategy relies on a Newton-like iterative solver which only…
We introduce an iterative scheme for discrete convex minimization problems of $p$-Laplace type such as variational graph $p$-Laplace problems and $\ell^p$ regression. In each iteration, the scheme solves only a weighted least-squares…
We attempt to provide an algorithm for approximating a solution of the quasiconvex equilibrium problem that was proved to exist by K. Fan 1972. The proposed algorithm is an iterative procedure, where the search direction at each iteration…
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Suba\c{s}i et al., Phys. Rev. Lett.…
In recent years, there have been significant advances in efficiently solving $\ell_s$-regression using linear system solvers and $\ell_2$-regression [Adil-Kyng-Peng-Sachdeva, J. ACM'24]. Would efficient smoothed $\ell_p$-norm solvers lead…
We devise variants of classical nonconforming methods for symmetric elliptic problems. These variants differ from the original ones only by transforming discrete test functions into conforming functions before applying the load functional.…
Randomized iterative algorithms have recently been proposed to solve large-scale linear systems. In this paper, we present a simple randomized extended block Kaczmarz algorithm that exponentially converges in the mean square to the unique…
We give an analysis of a continuation algorithm for the numerical solution of the force-based quasicontinuum equations. The approximate solution of the force-based quasicontinuum equations is computed by an iterative method using an…
We consider the method of quasi-solutions (also referred to as Ivanov regularization) for the regularization of linear ill-posed problems in non-reflexive Banach spaces. Using the equivalence to a metric projection onto the image of the…
Many problems in machine learning can be solved by rounding the solution of an appropriate linear program (LP). This paper shows that we can recover solutions of comparable quality by rounding an approximate LP solution instead of the ex-…
We prove quantitative decay rates for the linearised Vlasov-Poisson system around compactly supported equilibria. More precisely, we prove decay of the gravitational potential induced by the radial dynamics of this system in the presence of…
Efficient algorithms for the sparse solution of under-determined linear systems $Ax = b$ are known for matrices $A$ satisfying suitable assumptions like the restricted isometry property (RIP). Without such assumptions little is known and…
This article is concerned with the numerical solution of convex variational problems. More precisely, we develop an iterative minimisation technique which allows for the successive enrichment of an underlying discrete approximation space in…
We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…