let $c_0(alpha)$ denote the class of concave univalent functions defined in the open unit disk $mathbb{d}$. each function $f in c_{0}(alpha)$ maps the unit disk $mathbb{d}$ onto the complement of an unbounded convex set. in this paper, we study the mapping properties of this class under integral operators.

In this paper, we first introduce some function spaces, with certain locally convex topologies, closely  related to the space of real-valued continuous functions on $X$,  where $X$ is a $C$-distinguished topological space. Then, we show that their dual spaces can be identified in a natural way with certain spaces of Radon measures.

In this paper we prove that if $X $ is a Banach space, then for every lower semi-continuous bounded below function $f, $ there exists a $left(varphi_1, varphi_2right)$-convex function $g, $ with arbitrarily small norm,  such that $f + g $ attains its strong minimum on $X. $ This result extends some of the  well-known varitional principles as that of Ekeland [On the variational principle,  J. Ma...

the analysis of flow in water-distribution networks with several pumps by the content model may be turned into a non-convex optimization uncertain problem with multiple solutions. newton-based methods such as gga are not able to capture a global optimum in these situations. on the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

an analytical equation of state is applied to calculate the thermodynamic properties for argon. theequation of state is that of song and mason. it is based on a statistical-mechanical perturbation theory ofhard convex bodies and can be written as fifth-order polynomial in the density. there exist three temperaturedependentparameters: the second virial coefficient, an effective molecular volume,...

Given a quasi-concave-convex function f : X × Y → R defined on the product of two convex sets we would like to know if infY supX f = supX infY f . In [4] we showed that that question is very closely linked to the following “reconstruction” problem: given a polytope (i.e. the convex hull of a finite set of points) X and a family F of subpolytopes of X, we would like to know if X ∈ F, knowing tha...

Lemma A.1 (a) A real-valued convex function is also 0-convex and hence k-convex for all k ≥ 0. A k1-convex function is also a k2-convex function for k1 ≤ k2. (b) If f1(y) and f2(y) are k1-convex and k2-convex respectively, then for α, β ≥ 0, αf1(y) + βf2(y) is (αk1 + βk2)-convex. (c) If f(y) is k-convex and w is a random variable, then E{f(y − w)} is also k-convex, provided E{|f(y − w)|} < ∞ fo...

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...