Related papers: Convexity, critical points, and connectivity radiu…

We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…

Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…

This article is concerned with the approximation of unbounded convex sets by polyhedra. While there is an abundance of literature investigating this task for compact sets, results on the unbounded case are scarce. We first point out the…

In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…

A communication network is a graph in which each node has only local information about the graph and nodes communicate by passing messages along its edges. Here, we consider the {\it geometric communication network} where the nodes also…

We construct two minimal Cheeger sets in the Euclidean plane, i.e. unique minimizers of the ratio "perimeter over area" among their own measurable subsets. The first one gives a counterexample to the so-called weak regularity property of…

For the minimal graph defined on a convex ring in the space form with nonnegative curvature, we obtain the regularity and the strict convexity about its level sets by the continuity method.

This study presents functional limit theorems for the Euler characteristic of Vietoris-Rips complexes. The points are drawn from a non-homogeneous Poisson process on $\mathbb{R}^d$, and the connectivity radius governing the formation of…

Given a trivalent graph in the 3-dimensional Euclidean space, we call it a discrete surface because it has a tangent space at each vertex determined by its neighbor vertices. To abstract a continuum object hidden in the discrete surface, we…

Here we analyze three dimensional analogues of the classical Crofton's formula for planar compact convex sets. In this formula a fundamental role is played by the visual angle of the convex set from an exterior point. A generalization of…

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/k$. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of…

We consider a class of discrete convex functionals which satisfy a (generalized) coarea formula, and study their limit in the continuum.

We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…

In this paper we first consider the class of minimal time functions in the general setting of locally convex topological vector (LCTV) spaces. The results obtained in this framework are based on a novel notion of closedness of target sets…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

In the framework of shape constrained estimation, we review methods and works done in convex set estimation. These methods mostly build on stochastic and convex geometry, empirical process theory, functional analysis, linear programming,…

This expository article gives a survey of matrix convex sets, a natural generalization of convex sets to the noncommutative (dimension-free) setting, with a focus on their extreme points. Mirroring the classical setting, extreme points play…