Now showing items 1-10 of 1822
Convex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets ...
On Brondsted-Rockafellar's Theorem for convex lower semicontinuous epi pointed functions in locally convex spaces
In this work we give an extension of the Brondsted-Rockafellar Theorem, and some of its important consequences, to proper convex lower-semicontinuous epi-pointed functions defined in locally convex spaces. We use a new ...
Weaker conditions for subdifferential calculus of convex functions
In this paper we establish new rules for the calculus of the subdifferential mapping of the sum of two convex functions. Our results are established under conditions which are at an intermediate level of generality among ...
From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
Characterization of tropical hemispaces by (P,R)-decompositions
We consider tropical hemispaces, defined as tropically convex sets whose complements are also tropically convex, and tropical semispaces, defined as maximal tropically convex sets not containing a given point. We introduce ...
On the klee-saint raymond's characterization of convexity
Using techniques of convex analysis, we provide a direct proof of a recent characterization of convexity given in the setting of Banach spaces in [J. Saint Raymond, J. Nonlinear Convex Anal., 14 (2013), pp. 253-262]. Our ...
The Lyapunov order for real matrices
(Elsevier Science IncNew YorkEUA, 2009)
A pair of matrices sharing common Lyapunov solutions - A closer look
(Elsevier Science IncNew YorkEUA, 2003)
Synergistic solutions for merging and computing planar convex hulls
(Springer Verlag, 2018)
We describe and analyze the first adaptive algorithm for merging k convex hulls in the plane. This merging algorithm in turn yields a synergistic algorithm to compute the convex hull of a set of planar points, taking ...
Sets of probability distributions, independence, and convexity
This paper analyzes concepts of independence and assumptions of convexity in the theory of sets of probability distributions. The starting point is Kyburg and Pittarelli's discussion of "convex Bayesianism" (in particular ...