Related papers: Polyhedral approximations of strictly convex compa…
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,…
In this paper we develop a geometric approach to convex subdifferential calculus in finite dimensions with employing some ideas of modern variational analysis. This approach allows us to obtain natural and rather easy proofs of basic…
In this paper, we present a proof of Schauder estimate on Euclidean space and use it to generalize Donaldson's Schauder estimate on space with conical singularities in the following two directions. The first is that we allow the total cone…
The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the…
We consider geodesically convex optimization problems involving distances to a finite set of points $A$ in a CAT(0) cubical complex. Examples include the minimum enclosing ball problem, the weighted mean and median problems, and the…
We study the problem of reconstructing a positive discrete measure on a compact set $K \subseteq \mathbb{R}^n$ from a finite set of moments (possibly known only approximately) via convex optimization. We give new uniqueness results, new…
Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our…
Given a compact metric space $X$, we associate to it an inverse sequence of finite $T_0$ topological spaces. The inverse limit of this inverse sequence contains a homeomorphic copy of $X$ that is a strong deformation retract. We provide a…
An important open problem in geometric complex analysis is to find algorithms for explicit determination of basic functionals intrinsically connected with conformal and quasiconformal maps, such as their Teichmuller and Grunsky norms,…
The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…
Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
This study of properly or strictly convex real projective manifolds introduces notions of parabolic, horosphere and cusp. Results include a Margulis lemma and in the strictly convex case a thick-thin decomposition. Finite volume cusps are…
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs exist only for bounded problems [Ararat et al. 2022, Doerfler…
Let $X = G/\Gamma$, where $G$ is a Lie group and $\Gamma$ is a lattice in $G$, and let $U$ be a subset of $X$ whose complement is compact. We use the exponential mixing results for diagonalizable flows on $X$ to give upper estimates for the…
We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…
In this paper, we determine the sharp estimates for Toeplitz determinants of a subclass of close-to-convex harmonic mappings. Moreover, we obtain an improved version of Bohr's inequalities for a subclass of close-to-convex harmonic…