On the -uniformly close to convex functions with respect to a convex domain.
Blezu, Dorin (2001)
General Mathematics
Similarity:
Blezu, Dorin (2001)
General Mathematics
Similarity:
Caruso, A. (2002)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Jaspal Singh Aujla, H. L. Vasudeva (1995)
Annales Polonici Mathematici
Similarity:
The purpose of this note is to provide characterizations of operator convexity and give an alternative proof of a two-dimensional analogue of a theorem of Löwner concerning operator monotonicity.
Martini, Horst, Wenzel, Walter (2003)
Beiträge zur Algebra und Geometrie
Similarity:
Jolanta Plewnia (1993)
Annales Polonici Mathematici
Similarity:
If C is a non-empty convex subset of a real linear space E, p: E → ℝ is a sublinear function and f:C → ℝ is concave and such that f ≤ p on C, then there exists a linear function g:E → ℝ such that g ≤ p on E and f ≤ g on C. In this result of Hirano, Komiya and Takahashi we replace the sublinearity of p by convexity.
Nikodem, Kazimierz, Páles, Zsolt (2011)
Banach Journal of Mathematical Analysis [electronic only]
Similarity:
E. Ignaczak, A. Paszkiewicz (1998)
Applicationes Mathematicae
Similarity:
We prove that under some topological assumptions (e.g. if M has nonempty interior in X), a convex cone M in a linear topological space X is a linear subspace if and only if each convex functional on M has a convex extension on the whole space X.
M. Beltagy (1993)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper, local, global, strongly local and strongly global supportings of subsets in a complete simply connected smooth Riemannian manifold without focal points are defined. Sufficient conditions for convexity of subsets in the same sort of manifolds have been derived in terms of the above mentioned types of supportings.
Agnieszka Drwalewska, Lesław Gajek (1999)
Applicationes Mathematicae
Similarity:
Sufficient conditions are given for the global Pareto solution of the multicriterial optimization problem to be in a given convex subset of the domain. In the case of maximizing real valued-functions, the conditions are sufficient and necessary without any convexity type assumptions imposed on the function. In the case of linearly scalarized vector-valued functions the conditions are sufficient and necessary provided that both the function is concave and the scalarization is increasing...
Martini, Horst, Wenzel, Walter (2004)
Beiträge zur Algebra und Geometrie
Similarity: