Related papers: On a Convex Operator for Finite Sets

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

For an unbounded operator $S$ on a Banach space the existence of invariant subspaces corresponding to its spectrum in the left and right half-plane is proved. The general assumption on $S$ is the uniform boundedness of the resolvent along…

Let s be the space of rapidly decreasing sequences. We give the spectral representation of normal elements in the Fr\'echet algebra L(s',s) of the so-called smooth operators. We also characterize closed commutative *-subalgebras of L(s',s)…

We introduce the resolvent composition, a monotonicity-preserving operation between a linear operator and a set-valued operator, as well as the proximal composition, a convexity-preserving operation between a linear operator and a function.…

We establish what we consider to be the definitive versions of Jensen's operator inequality and Jensen's trace inequality for functions defined on an interval. This is accomplished by the introduction of genuine non-commutative convex…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

The level 1 highest weight modules of the quantum affine algebra $U_q(\widehat{\frak{sl}}_n)$ can be described as spaces of certain semi-infinite wedges. Using a $q$-antisymmetrization procedure, these semi-infinite wedges can be realized…

Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…

Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…

We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results for the Benedetto-Fickus frame potential. Our approach depends on…

Suppose that the set ${\mathcal{T}}= \{T_1, T_2,...,T_q \} $ of real $n\times n$ matrices has joint spectral radius less than $1$. Then for any digit set $ D= \{d_1, \cdots, d_q\} \subset {\Bbb R}^n$, there exists a unique nonempty compact…

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

In this paper we study a class of quadratic operators named by Volterra operators on infinite dimensional space. We prove that such operators have infinitely many fixed points and the set of Volterra operators forms a convex compact set. In…

This paper concerns three classes of real-valued functions on intervals, operator monotone functions, operator convex functions, and strongly operator convex functions. Strongly operator convex functions were previously treated in [3] and…

In this paper we explore the relation between the $A$-numerical range and the $A$-spectrum of $A$-bounded operators in the setting of semi-Hilbertian structure. We introduce a new definition of $A$-normal operator and prove that closure of…

In this manuscript the idea of soft convex structures is given and some of their properties are investigated. Also, soft convex sets, soft concave sets and soft convex hull operator are defined and their properties are studied. Moreover,…

We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $xx^{\mathrm{H}}$, where the elements of $x \in \mathbb{C}^n$ are $m$th unit roots. These polytopes have applications in ${\text{MAX-3-CUT}}$, digital…

We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…