Results 91 to 100 of about 11,297,589 (365)
Matrix Hermite-Hadamard type inequalities [PDF]
We present several matrix and operator inequalities of Hermite-Hadamard type. We first establish a majorization version for monotone convex functions on matrices. We then utilize the Mond-Pecaric method to get an operator version for convex functions. We
Moslehian, Mohammad Sal
core
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
Hermite–Hadamard–Fejér Type Inequalities for p-Convex Functions via Fractional Integrals
In this paper, firstly, Hermite–Hadamard–Fejér type inequalities for p-convex functions in fractional integral forms are built. Secondly, an integral identity and some Hermite–Hadamard–Fejér type integral inequalities for p-convex functions in fractional
M. Kunt, I. Işcan
semanticscholar +1 more source
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
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
SOS-convex Semi-algebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization [PDF]
In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials.
Chieu, N. H.+4 more
core +3 more sources
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
Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source