Related papers: The entropic barrier: a simple and optimal univers…

This paper shows that the self-concordance parameter of the universal barrier on any $n$-dimensional proper convex domain is upper bounded by $n$. This bound is tight and improves the previous $O(n)$ bound by Nesterov and Nemirovski. The…

For any convex body $K \subseteq \mathbb R^n$, S. Bubeck and R. Eldan introduced the entropic barrier on $K$ and showed that it is a $(1+o(1)) \, n$-self-concordant barrier. In this note, we observe that the optimal bound of $n$ on the…

We develop a short-step interior point method to optimize a linear function over a convex body assuming that one only knows a membership oracle for this body. The approach is based on Abernethy and Hazan's sketch of a universal interior…

Quantum relative entropies are jointly convex functions of two positive definite matrices that generalize the Kullback-Leibler divergence and arise naturally in quantum information theory. In this paper, we prove self-concordance of natural…

Barrier methods play a central role in the theory and practice of convex optimization. One of the most general and successful analyses of barrier methods for convex optimization, due to Nesterov and Nemirovskii, relies on the notion of…

Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of…

One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

We show that, for any prime power p^k and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into p^k convex sets with equal volume and equal surface area. We derive this result from a more…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

Self-concordant barriers are essential for interior-point algorithms in conic programming. To speed up the convergence it is of interest to find a barrier with the lowest possible parameter for a given cone. The barrier parameter is a…

We give a variational proof of the existence and uniqueness of a convex cap with the given upper boundary. The proof uses the concavity of the total scalar curvature functional on the space of generalized convex caps. As a byproduct, we…

We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…

Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…

We show that for any log-concave measure $\mu$ on $\mathbb{R}^n$, any pair of symmetric convex sets $K$ and $L$, and any $\lambda\in [0,1],$ $$\mu((1-\lambda) K+\lambda L)^{c_n}\geq (1-\lambda) \mu(K)^{c_n}+\lambda\mu(L)^{c_n},$$ where…

A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…

In this paper we theoretically show that interior-point methods based on self-concordant barriers possess favorable global complexity beyond their standard application area of convex optimization. To do that we propose first- and…

We prove that an arbitrary convex body $C \subseteq \mathbf{R}^{n+1} $, whose $ k $-th anisotropic curvature measure (for $ k =0, \ldots , n-1 $) is a multiple constant of the anisotropic perimeter of C, must be a rescaled and translated…

In this paper, we obtain the best possible value of the absolute constant $C$ such that for every isotropic convex body $K \subseteq \mathbb{R}^n$ the following inequality (which was proved by Klartag and reduces the hyperplane conjecture…

Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…