Related papers: Query-Efficient Fixpoints of $\ell_p$-Contractions

We study the $\ell_p$ regression problem, which requires finding $\mathbf{x}\in\mathbb R^{d}$ that minimizes $\|\mathbf{A}\mathbf{x}-\mathbf{b}\|_p$ for a matrix $\mathbf{A}\in\mathbb R^{n \times d}$ and response vector…

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

We give a lower bound for the $\ell^p$-distortion $c_p(X)$ of finite graphs $X$, depending on the first eigenvalue $\lambda_1^{(p)}(X)$ of the $p$-Laplacian and the maximal displacement of permutations of vertices. For a $k$-regular…

We propose a new $(1+O(\varepsilon))$-approximation algorithm with $O(n+ 1/\varepsilon^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$-dimensional Euclidean space for a fixed dimension $d$,…

We investigate the complexity of solving stable or perturbation-resilient instances of $k$-Means and $k$-Median clustering in fixed dimension Euclidean metrics (more generally doubling metrics). The notion of stable (perturbation resilient)…

In this paper we prove a partial $C^{1,\alpha}$ regularity result in dimension $N=2$ for the optimal $p$-compliance problem, extending for $p\not = 2$ some of the results obtained by A. Chambolle, J. Lamboley, A. Lemenant, E. Stepanov…

In this article, we discuss fixed point results for $(\varepsilon,\lambda)$-uniformly locally contractive self mapping defined on $\varepsilon$-chainable $G$-metric type spaces. In particular, we show that under some more general…

Let $\mathcal{A}\subset\mathbb{R}_{\geqslant1}$ be a countable set such that $\limsup_{x\to\infty}\frac{1}{\log x}\sum_{\alpha\in\mathcal{A}\cap[1,x]}\frac{1}{\alpha}>0$. We prove that, for every $\varepsilon>0$, there exist infinitely many…

In 2003, Del Pino and Dolbeault [14] and Gentil [19] investigated, independently, best constants and extremals associated to Euclidean Lp-entropy inequalities for p > 1. In this work, we present some contributions in the Riemannian context.…

Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions $f$ over unrestricted $d$-dimensional domains is one of the most fundamental problems in classical…

We consider weak solutions to a class of Dirichlet boundary value problems invloving the $p$-Laplace operator, and prove that the second weak derivatives are in $L^{q}$ with $q$ as large as it is desirable, provided $p$ is sufficiently…

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

We study the Ordered k-Median problem, in which the solution is evaluated by first sorting the client connection costs and then multiplying them with a predefined non-increasing weight vector (higher connection costs are taken with larger…

Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\geq 2$, we show that a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ and with $O(\log k)$ query time…

Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the approximate pattern matching problem asks for computation of a particular \emph{distance} function between $P$ and every $m$-substring of $T$. We consider a…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

This work revisits a recent finding by the first author concerning the local convergence of a regularized scalar conservation law. We significantly improve the original statement by establishing a global convergence result within the…

Clustering with capacity constraints is a fundamental problem that attracted significant attention throughout the years. In this paper, we give the first FPT constant-factor approximation algorithm for the problem of clustering points in a…

The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…

In this paper we establish $W^{1,p}$ estimates for solutions $u_\varepsilon$ to Laplace's equation with the Dirichlet condition in a bounded and perforated, not necessarily periodically, $C^1$ domain $\Omega_{\varepsilon, \eta}$ in…