Related papers: Some approximation problems in semi-algebraic geom…
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…
Since its introduction by Symons, the semigroup of maps with restricted range has been studied in the context of transformations on a set, or of linear maps on a vector space. Sets and vector spaces being particular examples of independence…
A set of points in d-dimensional Euclidean space is almost equidistant if among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in $\mathbb{R}^d$ has cardinality $O(d^{4/3})$.
In this paper, using the concept of natural density, we have introduced the notion of rough statistical convergence which is an extension of the notion of rough convergence in a partial metric space. We have defined the set of rough…
Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple…
In this paper we study existence, regularity, and approximation of solution to a fractional semilinear elliptic equation of order $s \in (0,1)$. We identify minimal conditions on the nonlinear term and the source which leads to existence of…
Concentration of measure has been argued to be the fundamental cause of adversarial vulnerability. Mahloujifar et al. presented an empirical way to measure the concentration of a data distribution using samples, and employed it to find…
In this paper, we prove approximate lifting results in the C$^{\ast}$-algebra and von Neumann algebra settings. In the C$^{\ast}$-algebra setting, we show that two (weakly) semiprojective unital C*-algebras, each generated by $n$…
We introduce a new version of Stein's method that reduces a large class of normal approximation problems to variance bounding exercises, thus making a connection between central limit theorems and concentration of measure. Unlike Skorokhod…
This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…
We review the finite element approximation of the classical obstacle problem in energy and max-norms and derive error estimates for both the solution and the free boundary. On the basis of recent regularity results we present an optimal…
$ \newcommand{\eps}{\varepsilon} \newcommand{\problem}[1]{\ensuremath{\mathrm{#1}} } \newcommand{\CVP}{\problem{CVP}} \newcommand{\SVP}{\problem{SVP}} \newcommand{\CVPP}{\problem{CVPP}} \newcommand{\ensuremath}[1]{#1} $For odd integers $p…
Higher-order regularization problem formulations are popular frameworks used in machine learning, inverse problems and image/signal processing. In this paper, we consider the computational problem of finding the minimizer of the Sobolev…
In this paper, the proximal point algorithm for quasi-convex minimization problem in nonpositive curvature metric spaces is studied. We prove $\Delta$-convergence of the generated sequence to a critical point (which is defined in the text)…
The growing amount of applications that generate vast amount of data in short time scales render the problem of partial monitoring, coupled with prediction, a rather fundamental one. We study the aforementioned canonical problem under the…
The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…
Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications. Certifying optimality, however, is NP-hard and practically hampered already by the…
We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions…