Related papers: A Note on Weighted Fermat Problem in Lp Space
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
Given a set of oriented hyperplanes $\mathcal{P}=\{p_1, ..., p_k\}$ in $\mathbb{R}^n$, define $v(P)$ for any point $P\in\mathbb{R}^n$ as the sum of the signed distances from $P$ to $p_1$,..., $p_k$. We give a simple geometric…
We discuss the computational complexity of special cases of the 3-dimensional (axial) assignment problem where the elements are points in a Cartesian space and where the cost coefficients are the perimeters of the corresponding triangles…
Over the last two decades, several fast, robust, and high-order accurate methods have been developed for solving the Poisson equation in complicated geometry using potential theory. In this approach, rather than discretizing the partial…
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs)…
This paper is about iteratively reweighted basis-pursuit algorithms for compressed sensing and matrix completion problems. In a first part, we give a theoretical explanation of the fact that reweighted basis pursuit can improve a lot upon…
We present a weak finite element method for elliptic problems in one space dimension. Our analysis shows that this method has more advantages than the known weak Galerkin method proposed for multi-dimensional problems, for example, it has…
The paper proposes a new algorithm for solving global univariate optimization problems. The algorithm does not require convexity of the target function. For a broad variety of target functions after performing (if necessary) several…
In this article, we present a method for increasing adaptivity of an existing robust estimation algorithm by learning two parameters to better fit the residual distribution. The analyzed method uses these two parameters to calculate weights…
In this paper we develop new applications of variational analysis and generalized differentiation to the following optimization problem and its specifications: given n closed subsets of a Banach space, find such a point for which the sum of…
In this paper, we first introduce some new classes of weighted amalgam spaces. Then we give the weighted strong-type and weak-type estimates for fractional integral operators $I_\gamma$ on these new function spaces. Furthermore, the…
This article explores weighted $(L^p, L^q)$ inequalities for the Fourier transform in rank one Riemannian symmetric spaces of noncompact type. We establish both necessary and sufficient conditions for these inequalities to hold. To prove…
We propose an extension of a special form of gradient descent -- in the literature known as linearised Bregman iteration -- to a larger class of non-convex functions. We replace the classical (squared) two norm metric in the gradient…
We obtain regularity results in weighted Sobolev spaces for the solution of the obstacle problem for the integral fractional Laplacian. The weight is a power of the distance to the boundary. These bounds then serve us as a guide in the…
We establish the global gradient bounds for weak solutions to the elliptic variational inequality with two-sided obstructions, associated with a $p(x)$-Laplacian type operator involving degenerate or singular matrix weights. Under the…
Consider an i.i.d. sample from an unknown density function supported on an unknown manifold embedded in a high dimensional Euclidean space. We tackle the problem of learning a distance between points, able to capture both the geometry of…
This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
This paper focuses on the numerical solution of initial value problems for fractional differential equations of linear type. The approach we propose grounds on expressing the solution in terms of some integral weighted by a generalized…
Geometric programming is an important class of optimization problems that enable practitioners to model a large variety of real-world applications, mostly in the field of engineering design. In many real life optimization problem…