Related papers: Convexity and Cone-Vexing
This talk is a write-up on some origins of abstract convexity and afew vexing limitations on the range of abstraction in convexity.
We introduce a notion of probabilistic convexity and generalize some classical globalization theorems in Alexandrov geometry. A weighted Alexandrov's lemma is developed as a basic tool.
During the years 1940-1970, Alexandrov and the "Leningrad School" have investigated the geometry of singular surfaces in depth. The theory developed by this school is about topological surfaces with an intrinsic metric for which we can…
We show a new, elementary and geometric proof of the classical Alexandrov theorem about the second order differentiability of convex functions. We also show new proofs of recent results about Lusin approximation of convex functions and…
In the Euclidean setting, the well-known Alexandrov theorem states that convex functions are twice differentiable almost everywhere. In this note, we extend this theorem to rank-one convex functions. Our approach is novel in that it draws…
The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this…
We treat the classical notion of convexity in the context of hard real analysis. Definitions of the concept are given in terms of defining functions and quadratic forms, and characterizations are provided of different concrete notions of…
Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…
The term "tropical convexity" was coined by Develin and Sturmfels who published a landmark paper with that title in 2004. However, the topic has much older roots and is deeply connected to linear and combinatorial optimization and other…
Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…
The Alexandrov-Fenchel inequality, a far-reaching generalization of the classical isoperimetric inequality to arbitrary mixed volumes, lies at the heart of convex geometry. The characterization of its extremal bodies is a long-standing open…
If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…
In the early 1960's, Moreau and Rockafellar introduced a concept of called \emph{subgradient} for convex functions, initiating the developments of theoretical and applied convex analysis. The needs of going beyond convexity motivated the…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
In the present paper, we introduce a new concept of convexity which is generated by a family of endomorphisms of an Abelian group. In Abelian groups equipped with a translation invariant metric, we define the boundedness, the norm, the…
The notion of $n$th order convexity in the sense of Hopf and Popoviciu is defined via the nonnegativity of the $(n+1)$st order divided differences of a given real-valued function. In view of the well-known recursive formula for divided…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
This work is a continuation of what was done in a previous paper and strongly connected to the recent work of U. Abel and I. Rasa [arXiv:1707.00127]
This paper builds upon our prior formalisation of R^n in ACL2(r) by presenting a set of theorems for reasoning about convex functions. This is a demonstration of the higher-dimensional analytical reasoning possible in our metric space…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…