Related papers: Note on Minkowski Summation and Unimodularity in D…
The aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
Can the Minkowski sum of two compact convex bodies be made smoother by rotating one of them? We construct two infinitely differentiable strictly convex plane bodies such that after any generic rotation (in the Baire category sense) of one…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
Minkowski space, conformal group, compactification, conformal infinity, conformal inversion, light cone at infinity, SU(2,2), SO(4,2), Hodge star operator, Clifford algebra, spinors, twistors, antilinear operators, exterior algebra,…
In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…
This letter casts the problem of optimum discrete beamforming as the computation of the Minkowski sum of convex polygons, which is itself a convex polygon. The number of vertices of the latter is at most the sum of the number of vertices of…
In this paper, we use concept of q-calculus and technique of convolution to study the q-Ruscheweyeh derivative by the concept of Janowski function, then we define new Subclass of analytic functions. Coefficients Estimates, radii of…
In this study, we obtain some new integral inequalities for different classes of convex functions by using some elementary inequalities and classical inequalities like general Cauchy inequality and Minkowski inequality.
The aim of this paper is threefold: a) Finding new direct and inverse results in the additive number theory concerning Minkowski sums of dilates. b) Finding a connection between the above results and some direct and inverse problems in the…
We give simple new proofs of two well-known results for the Schr\"odinger operator: first, the Brunn--Minkowski inequality for Dirichlet eigenvalues and, second, the log-concavity of the first Dirichlet eigenfunction. Our proof of the first…
The famous Minkowski inequality provides a sharp lower bound for the mixed volume $V(K,M[n-1])$ of two convex bodies $K,M\subset\mathbb{R}^n$ in terms of powers of the volumes of the individual bodies $K$ and $M$. The special case where $K$…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified…
We prove stability estimates for the Brunn-Minkowski inequality for convex sets. Unlike existing stability results, our estimates improve as the dimension grows. Our results are equivalent to a thin shell bound, which is one of the central…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
This is an expository paper, giving a simplified proof of the cubic case of the main conjecture for Vinogradov's mean value theorem.
This expository paper presents elementary proofs of four basic results concerning derivatives of quasi-convex functions. They are combined into a fifth theorem which is simple to apply and adequate in many cases. Along the way we establish…
The Minkowski Question Mark function relates the continued-fraction representation of the real numbers, to their binary expansion. This function is peculiar in many ways; one is that its derivative is 'singular'. One can show by classical…
Composite minimization is a powerful framework in large-scale convex optimization, based on decoupling of the objective function into terms with structurally different properties and allowing for more flexible algorithmic design. We…