In this technical note we give a short proof based on standard results in convex analysis of some important characterization results listed in Theorem 3 and 4 of [1]. Actually our result is slightly general since we do not specify the convex set X. For clarity we use the same notation for the different equivalent optimization problems as done in [1]. Free keywords global optimalization, single ...

Making use of the generalized hypergeometric functions, we define a new subclass of uniformly convex functions and a corresponding subclass of starlike functions with negative coefficients and obtain coefficient estimates, extreme points, the radii of close-to-convexity, starlikeness and convexity, and neighborhood results for the class TSm α, β, γ . In particular, we obtain integral means ineq...

We focus on the problem of minimizing a convex function f over a convex set S given T queries to a stochastic first order oracle. We argue that the complexity of convex minimization is only determined by the rate of growth of the function around its minimizer xf,S , as quantified by a Tsybakov-like noise condition. Specifically, we prove that if f grows at least as fast as ‖x − xf,S‖ around its...

‎the purpose of this paper is to introduce a new mapping for a finite‎ ‎family of accretive operators and introduce an iterative algorithm‎ ‎for finding a common zero of a finite family of accretive operators‎ ‎in a real reflexive strictly convex banach space which has a‎ ‎uniformly g^ateaux differentiable norm and admits the duality‎ ‎mapping $j_{varphi}$‎, ‎where $varphi$ is a gauge function ...

in this paper, downlink resource allocation for a sparse code multiple access (scma) based heterogeneous  cellular networks (hcn) is investigated. the main aim of this paper is to obtain joint power allocation and codebook assignment to achieve the least total system transmit power. in this regard, the proposed objective function is formulated as total transmit power subject to users minimum ra...

We show that, if a building is endowed with its complete system of apartments, and if each panel is contained in at least four chambers, then the intersection of two apartments can be any convex subcomplex contained in an apartment. This combinatorial result is particularly interesting for lower dimensional convex subcomplexes of apartments, where we definitely need the assumption on the four c...

The following result of convex analysis is well–known [2]: If the function f : X → [−∞, +∞] is convex and some x0 ∈ core (dom f) satisfies f(x0) > −∞, then f never takes the value −∞. From a corresponding theorem for convex functions with values in semi–linear spaces a variety of results is deduced, among them the mentioned theorem, a theorem of Deutsch and Singer on the single–valuedness of co...

We define a convex extension of a lower-semicontinuous function to be a convex function that is identical to the given function over a pre-specified subset of its domain. Convex extensions are not necessarily constructible or unique. We identify conditions under which a convex extension can be constructed. When multiple convex extensions exist, we characterize the tightest convex extension in a...

We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z. We consider two kinds of convexity of a fuzzy set, namely quasi convexity and strong convexity, and we propose two algorithms for the construction of both kinds of convex hull of a digital fuzzy set.

In this paper, we deal with the convex generators 1 of a graph G = (V(G),E(G)). A convex generator being a minimal set whose convex hull is V(G), we show that it is included in the "boundary" of G. Then we show that the "boundary" of a polymino's graph, or more precisely the seaweed's "boundary", enjoys some nice properties which permit us to prove that for such a graph G, the minimal size of a...