Related papers: On Some Generalized Polyhedral Convex Construction…

This is a chapter (planned to appear in Wiley's upcoming Encyclopedia of Operations Research and Management Science) describing parts of the theory of convex polyhedra that are particularly important for optimization. The topics include…

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

The work consists of solutions of metric problems for convex and finite subsets of geodesic spaces.

Given n >= 4 positive real numbers, we prove in this note that they are the face areas of a convex polyhedron if and only if the largest number is not more than the sum of the others.

In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality,…

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

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,…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

In convex geometry, the constructions that assign to a convex body its difference body, projection body, or volume have the following properties: They are (1) invariant under volume-preserving linear changes of coordinates; (2) continuous;…

While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily…

A function of a matrix is polyconvex when it can be expressed as a convex function of the matrix minors. Polyconvexity is a regularity condition ensuring existence of minimizers in nonlinear elasticity and, more broadly, in vectorial…

A polarity notion for sets in a Banach space is introduced in such a way that the second polar of a set coincides with the smallest strongly convex set with respect to R that contains it. Strongly convex sets are characterized in terms of…

We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…

We give a definition of generalized hypergeometric functions over finite fields using modified Gauss sums, which enables us to find clear analogy with classical hypergeometric functions over the complex numbers. We study their fundamental…

This paper studies the convexity properties of nonsmooth extended-real-valued weakly convex functions, a class of functions that is central to modern optimization and its applications. We establish new characterizations of convexity using…

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

In this paper some concepts of convex analysis on hyperbolic space are studied. We first study properties of the intrinsic distance, for instance, we present the spectral decomposition of its Hessian. Next, we study the concept of convex…