Related papers: Order Isomorphisms on Convex Functions in Windows
It is known that a real function $f$ is convex if and only if the set $$\mathrm{E}(f)=\{(x,y)\in\mathbb{R}\times\mathbb{R};\ f(x)\leq y\},$$ the epigraph of $f$ is a convex set in $\mathbb{R}^2$. We state an extension of this result for…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
According to a 2002 theorem by Cardaliaguet and Tahraoui, an isotropic, compact and connected subset of the group $\operatorname{GL}^+(2)$ of invertible $2\times2-\,$matrices is rank-one convex if and only if it is polyconvex. In a 2005…
We prove an implicit function theorem for C^k-maps from arbitrary topological vector spaces over valued fields to Banach spaces (for k at least 2). As a tool, we show the C^k-dependence of fixed points on parameters for suitable families of…
Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…
A classical result of variational analysis, known as Attouch theorem, establishes the equivalence between epigraphical convergence of a sequence of proper convex lower semicontinuous functions and graphical convergence of the corresponding…
This paper investigates functions from $\mathbb{R}^d$ to $\mathbb{R} \cup \{\pm \infty\}$ that satisfy axioms of linearity wherever allowed by extended-value arithmetic. They have a nontrivial structure defined inductively on $d$, and…
A new deconvolution algorithm based on orthogonal projections onto the epigraph set of a convex cost function is presented. In this algorithm, the dimension of the minimization problem is lifted by one and sets corresponding to the cost…
We present a characterization of effective descent morphisms in the lax comma category $\mathsf{Ord}//X$ when $X$ is a locally complete ordered set, as well as in the antisymmetric setting.
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 consider the order m k-automorphisms of SL(2,k). We first characterize the forms that order m k-automorphisms of SL(2,k) take and then we simple conditions on matrices A and B, involving eigenvalues and the field that the…
In this paper, we establish various inequalities for some mappings that are linked with the illustrious Hermite-Hadamard integral inequality for mappings whose absolute values belong to the class K?;s m;1 and K?;s m;2.
In this paper we established new integral inequalities which are more general results for coordinated convex functions on the coordinates by using some classical inequalities.
In this paper we put forward the definition of particular subsets on a unital C*-algebra, that we call isocones, and which reduce in the commutative case to the set of continuous non-decreasing functions with real values for a partial order…
This paper studies system theoretic properties of the class of difference inclusions of convex processes. We will develop a framework considering eigenvalues and eigenvectors, weakly and strongly invariant cones, and a decomposition of…
The main object of the present paper is to, introduce the. class of meromorphic univalent functions Involving! hypergeomatrc function .We obtain~ some interesting geometric properties according to coefficient inequality , growth and…
A coloring of the vertices of a connected graph is convex if each color class induces a connected subgraph. We address the convex recoloring (CR) problem defined as follows. Given a graph $G$ and a coloring of its vertices, recolor a…
A functional analog of the Klain-Schneider theorem for vector-valued valuations on convex functions is established, providing a classification of continuous, translation covariant, simple valuations. Under additional rotation equivariance…
Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms…