相关论文: On the Properties of Convex Functions over Open Se…
It is shown that a possibly infinite-valued proper lower semicontinuous convex function on ${\mathbb R}^n$ has an extension to a convex function on the half-space ${\mathbb R}^n\times[0,\infty)$ which is finite and smooth on the open…
In this paper, based on concepts of convex sets and convex functions, we introduce new concepts of functions, Young functions, strong Young functions and Orlicz functions by relaxing definitions of functions, Young functions, strong Young…
In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…
We give a thoroughful explanation of the general properties of different, general scales, corresponding to different (all possible) mathematical functions f(x), we mention and analyse many examples. These observations and statements might…
A new version of the Hadwiger theorem on convex functions is established and an explicit representation of functional intrinsic volumes is found using new functional Cauchy-Kubota formulas. In addition, connections between functional…
In this short note, we extend the linear convergence result of the Cauchy algorithm, derived recently by E. Klerk, F. Glineur, and A. Taylor, from the case of smooth strongly convex functions to the case of restricted strongly convex…
We investigate metric projections and distance functions referring to convex bodies in finite-dimensional normed spaces. For this purpose we identify the vector space with its dual space by using, instead of the usual identification via the…
In the present article we provide a sufficient condition for a closed set F in R^d to have the following property which we call c-removability: Whenever a function f:R^d->R is locally convex on the complement of F, it is convex on the whole…
This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…
We show that domains, that allow for convex functions with unbounded gradient at their boundary, are convex.
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
There exist two major subclasses in the class of superquadratic functions, one comprises concave and decreasing functions, while the other consists of convex and monotone increasing functions. Leveraging this distinction, we introduce…
A function between two metric spaces is said to be totally bounded regular if it preserves totally bounded sets. These functions need not be continuous in general. Hence the purpose of this article is to study such functions vis-\'a-vis…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
We revisit the geometrically decaying step size given a positive inverse condition number, under which a locally Lipschitz function shows linear convergence. The positivity does not require the function to satisfy convexity, weak convexity,…
We prove local inequalities for analytic functions defined on a convex body in $\Re^{n}$ which generalize well-known classical inequalities for polynomials.
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
Constructive properties of uniform convexity, strict convexity, near convexity, and metric convexity in real normed linear spaces are considered. Examples show that certain classical theorems, such as the existence of points of osculation,…