Related papers: Approximation of length minimization problems amon…
Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…
Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…
We consider the approximation of minimal geodesics between two closed sets in $\mathbb{R}^D$ endowed with a smooth Riemannian metric. The continuous problem is formulated as the minimization of the energy functional over piecewise smooth…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate…
We present a general technique for approximating bicriteria minimization problems with positive-valued, polynomially computable objective functions. Given $0<\epsilon\leq1$ and a polynomial-time $\alpha$-approximation algorithm for the…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…
Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…
The paper is devoted to introducing an approach to compute the approximate minimum time function of control problems which is based on reachable set approximation and uses arithmetic operations for convex compact sets. In particular, in…
This paper is concerned with the $\Gamma$-limits of Ambrosio-Tortorelli-type functionals, for maps $u$ defined on an open bounded set $\Omega\subset\mathbb R^n$ and taking values in the unit circle $\mathbb S^1\subset\mathbb R^2$. Depending…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
Given a compact $E \subset \mathbb{R}^n$ and $s > 0$, the maximum distance problem seeks a compact and connected subset of $\mathbb{R}^n$ of smallest one dimensional Hausdorff measure whose $s$-neighborhood covers $E$. For $E\subset…
As shown in [15], under some structural assumptions, working on congested traffic problems in general and increasingly dense networks leads, at the limit by {\Gamma}-convergence, to continuous minimization problems posed on measures on…
This paper provides fascinating connections between several mathematical problems which lie on the intersection of several mathematics subjects, namely algebraic geometry, approximation theory, complex-harmonic analysis and high dimensional…
In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by…
We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…
An inequality is derived for the average $t$-energy of pinned distance measures, where $0 < t < 1$. This refines Mattila's theorem on distance sets to pinned distance sets, and gives an analogue of Liu's theorem for pinned distance sets of…
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…
In a directed graph $G$ with non-correlated edge lengths and costs, the \emph{network design problem with bounded distances} asks for a cost-minimal spanning subgraph subject to a length bound for all node pairs. We give a bi-criteria…