Results 81 to 90 of about 1,126,227 (356)
Some majorization integral inequalities for functions defined on rectangles
In this paper, we first prove an integral majorization theorem related to integral inequalities for functions defined on rectangles. We then apply the result to establish some new integral inequalities for functions defined on rectangles.
Shanhe Wu+3 more
doaj +1 more source
Approximately convex functions [PDF]
So far we have discussed the stability of various functional equations. In the present section, we consider the stability of a well-known functional inequality, namely the inequality defining convex functions: $$f\left( {\lambda x + \left( {1 - \lambda } \right)y} \right) \leqslant \lambda f\left( x \right) + \left( {1 - \lambda } \right)f\left( y \
Stanislaw M. Ulam, Donald H. Hyers
openaire +2 more sources
On approximately convex functions [PDF]
The Bernstein-Doetsch theorem on midconvex functions is extended to approximately midconvex functions and to approximately Wright convex functions.
Kazimierz Nikodem, C. T. Ng
openaire +2 more sources
StahlDigital: Ontology‐Based Workflows for the Steel Industry
The strength of the steel industry is based on the mastery of microstructure–property relationships. Digital workflows contribute to this aim by making the complexity of workflows reproducible and their execution user independent. The tools and workflows developed in the project StahlDigital as part of the German MaterialDigital initiative are ...
Franz Roters+18 more
wiley +1 more source
Dynamical significance of generalized fractional integral inequalities via convexity
The main goal of this paper is to develop the significance of generalized fractional integral inequalities via convex functions. We obtain the new version of fractional integral inequalities with the extended Wright generalized Bessel function acting as ...
Sabila Ali+7 more
doaj +1 more source
In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is nonconvex and it can be written as the difference of two convex functions. The proposed
Chatzinotas, Symeon+3 more
core +1 more source
On Basic Operations Related to Network Induction of Discrete Convex Functions [PDF]
Discrete convex functions are used in many areas, including operations research, discrete-event systems, game theory, and economics. The objective of this paper is to investigate basic operations such as direct sum, splitting, and aggregation that are related to network induction of discrete convex functions as well as discrete convex sets.
arxiv
Subordination by convex functions [PDF]
The following theorem is proven: Let F ( z ) F(z) be convex and univalent in Δ = { z : | z | > 1 } , F ( 0 ) = 1 \Delta = \{ z:|z| > 1\} ,F(0)
Stephan Ruscheweyh, D. J. Hallenbeck
openaire +1 more source
The MaterialDigital initiative drives the digital transformation of material science by promoting findable, accessible, interoperable, and reusable principles and enhancing data interoperability. This article explores the role of scientific workflows, highlights challenges in their adoption, and introduces the Workflow Store as a key tool for sharing ...
Simon Bekemeier+37 more
wiley +1 more source
New ways for comparing and bounding strongly ( s , m ) $(s,m)$ -convex functions using Caputo fractional derivatives and Caputo-Fabrizio integral operators are explored.
Jie Li+4 more
doaj +1 more source