Related papers: A geometric approach to second-order differentiabi…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

We show that every finite-dimensional Alexandrov space X with curvature bounded from below embeds canonically into a product of an Alexandrov space with the same curvature bound and a Euclidean space such that each affine function on X…

As a discrete counterpart to the classical John theorem on the approximation of (symmetric) $n$-dimensional convex bodies $K$ by ellipsoids, Tao and Vu introduced so called generalized arithmetic progressions $P(A,b)\subset Z^n$ in order to…

We give a systematic and thorough study of geometric notions and results connected to Minkowski's measure of symmetry and the extension of the well-known Minkowski functional to arbitrary, not necessarily symmetric convex bodies K on any…

This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid systems. Polyhedral Lyapunov functions provide an alternative to…

Convergence analysis of Nesterov's accelerated gradient method has attracted significant attention over the past decades. While extensive work has explored its theoretical properties and elucidated the intuition behind its acceleration, a…

We give a simple deduction of a recent theorem of D. Ryabogin and V. Yaskin, about detecting symmetry of star bodies in ${\Bbb{R}}^n$ with $C^1$ radial functions --- via their conical section functions --- from an older theorem of us.

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

We develop two new tools for use in Alexandrov geometry: a theory of ramified orientable double covers and a particularly useful version of the Slice Theorem for actions of compact Lie groups. These tools are applied to the classification…

Extending classical results on polytopal approximation of convex bodies, we derive asymptotic formulas for the weighted approximation of smooth convex functions by piecewise affine convex functions as the number of their facets tends to…

We provide a short proof of the intriguing characterisation of the convex order given by Wiesel and Zhang.

In this paper, two new lemmas are proved and inequalities are established for co-ordinated convex functions and co-ordinated s-convex functions.

We formulate two classes of first-order algorithms more general than previously studied for minimizing smooth and strongly convex or, respectively, smooth and convex functions. We establish sufficient conditions, via new discrete Lyapunov…

We apply duality theory to discretized convex minimization problems to obtain computable guaranteed upper bounds for the distance of given discrete functions and the exact discrete minimizer. Furthermore, we show that the discrete duality…

The theory of first-order differential subordination developed by Miller and Mocanu was recently extended to functions with fixed initial coefficient by R. M. Ali, S. Nagpal and V. Ravichandran [Second-order differential subordination for…

We prove the existence of secondary terms of order X^{5/6} in the Davenport-Heilbronn theorems on cubic fields and 3-torsion in class groups of quadratic fields. For cubic fields this confirms a conjecture of Datskovsky-Wright and Roberts.…

Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A progress to go beyond convexity was made by considering the…

We prove that if $u:\mathbb{R}^n\to\mathbb{R}$ is strongly convex, then for every $\varepsilon>0$ there is a strongly convex function $v\in C^2(\mathbb{R}^n)$ such that $|\{u\neq v\}|<\varepsilon$ and $\Vert u-v\Vert_\infty<\varepsilon$.

We prove the boundedness of complements modulo two conjectures: Borisov-Alexeev conjecture and effective adjunction for fibre spaces. We discuss the last conjecture and prove it in two particular cases.