Results 261 to 270 of about 24,937 (297)
Narrative-affect discrepancy as a regulated degree of freedom in 351,734 relationship narratives. [PDF]
Kim RS.
europepmc +1 more source
On strongly $h$-convex functions
We introduce the notion of strongly $h$-convex functions (defined on a normed space) and present some properties and representations of such functions. We obtain a characterization of inner product spaces involving the notion of strongly $h$-convex functions. Finally, a Hermite-Hadamard-type inequality for strongly $h$-convex functions
Kazimierz Nikodem
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Converse Ohlin’s lemma for convex and strongly convex functions
Journal of Applied Analysis, 2022Abstract Theorems which are converse to the Ohlin lemma for convex and strongly convex functions are proved. New proofs of probabilistic characterizations of convex and strongly convex functions are presented.
Mirosław Adamek, Kazimierz Nikodem
openaire +1 more source
Canonical Models on Strongly Convex Domains via the Squeezing Function [PDF]
We prove that if a holomorphic self-map $fcolon Omega o Omega$ of a bounded strongly convex domain $Omegasubset mathbb C^q$ with smooth boundary is hyperbolic then it admits a natural semi-conjugacy with a hyperbolic automorphism of a possibly lower ...
Amedeo Altavilla +2 more
exaly +2 more sources
Remarks on strongly convex functions
Aequationes Mathematicae, 2010Let \(I\subseteq \mathbb{R}\) be an interval and \(c\) be a positive number. A function \(f:I\rightarrow \mathbb{R}\) is called strongly convex with modulus \( c\) if \[ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)-ct(1-t)(x-y)^{2}, \] for all \(x,y\in I\) and \(t\in [0,1]\).
Nelson Merentes +2 more
exaly +3 more sources
iPiasco: Inertial Proximal Algorithm for Strongly Convex Optimization
In this paper, we present a forward–backward splitting algorithm with additional inertial term for solving a strongly convex optimization prob-lem of a certain type. The strongly convex objective function is assumed to be a sum of a non-smooth convex and
Peter Ochs, Thomas Brox, Thomas Pock
exaly +2 more sources
Strongly E-convex sets and strongly E-convex functions
Journal of Interdisciplinary Mathematics, 2005Abstract A class of E-convex sets and a class of E-convex functions are extended to the so called strongly E-convex sets and strongly E-convex functions. In this extension we take into account the images of two points x and y under an E : Rn → Rn operator besides the two points themselves.
E. A. Youness, Tarek Emam
openaire +1 more source
INVARIANCE OF THE COEFFICIENTS OF STRONGLY CONVEX FUNCTIONS
Bulletin of the Australian Mathematical Society, 2016Let the function $f$ be analytic in $\mathbb{D}=\{z:|z|<1\}$ and given by $f(z)=z+\sum _{n=2}^{\infty }a_{n}z^{n}$. For $0<\unicode[STIX]{x1D6FD}\leq 1$, denote by ${\mathcal{C}}(\unicode[STIX]{x1D6FD})$ the class of strongly convex functions.
Thomas, D. K., Verma, Sarika
openaire +2 more sources
The Order of Strongly Starlikeness of the Generalized α-Convex Functions [PDF]
We consider the order of the strongly-starlikeness of the generalized α -convex functions. Some sufficient conditions for functions to be p-valently strongly-starlike are given.
Rekha Srivastava +2 more
exaly +3 more sources

