Results 41 to 50 of about 11,050,393 (374)

Some Estimates of k-Fractional Integrals for Various Kinds of Exponentially Convex Functions

open access: yesFractal and Fractional, 2023
In this paper, we aim to find unified estimates of fractional integrals involving Mittag–Leffler functions in kernels. The results obtained in terms of fractional integral inequalities are provided for various kinds of convex and related functions.
Yonghong Liu   +3 more
doaj   +1 more source

Ostrowski type inequalities via some exponentially convex functions with applications

open access: yesAIMS Mathematics, 2020
In this paper, we obtain ostrowski type inequalities for exponentially convex function and exponentially s-convex function in second sense. Applications to some special means are also obtain. Here we extend the results of some previous investigations.
Naila Mehreen, Matloob Anwar
doaj   +1 more source

On the (p,h)-convex function and some integral inequalities

open access: yes, 2014
In this paper, we introduce a new class of (p,h)-convex functions which generalize P-functions and convex, h,p,s-convex, Godunova-Levin functions, and we give some properties of the functions.
Z. Fang, Renjie Shi
semanticscholar   +1 more source

Convex combinations, barycenters and convex functions [PDF]

open access: yesJournal of Inequalities and Applications, 2013
The article first shows one alternative definition of convexity in the discrete case. The correlation between barycenters, Jensen's inequality and convexity is studied in the integral case. The Hermite-Hadamard inequality is also obtained as a consequence of a concept of barycenters.
openaire   +3 more sources

Projections Onto Convex Sets (POCS) Based Optimization by Lifting [PDF]

open access: yes, 2013
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex and some non-convex optimization problems are presented.
Bozkurt, A.   +7 more
core   +2 more sources

A note on generalized convex functions

open access: yesJournal of Inequalities and Applications, 2019
In the article, we provide an example for a η-convex function defined on rectangle is not convex, prove that every η-convex function defined on rectangle is coordinate η-convex and its converse is not true in general, define the coordinate (η1,η2) $(\eta
Syed Zaheer Ullah   +2 more
doaj   +1 more source

Modulus of convexity for operator convex functions [PDF]

open access: yesJournal of Mathematical Physics, 2014
Given an operator convex function f(x), we obtain an operator-valued lower bound for cf(x) + (1 − c)f(y) − f(cx + (1 − c)y), c ∈ [0, 1]. The lower bound is expressed in terms of the matrix Bregman divergence. A similar inequality is shown to be false for functions that are convex but not operator convex.
openaire   +5 more sources

On uniformly convex functions [PDF]

open access: yesJournal of Mathematical Analysis and Applications, 2022
Non-convex functions that yet satisfy a condition of uniform convexity for non-close points can arise in discrete constructions. We prove that this sort of discrete uniform convexity is inherited by the convex envelope, which is the key to obtain other remarkable properties such as the coercivity.
M. Raja, Guillaume Grelier
openaire   +3 more sources

Fractional Hadamard and Fejér-Hadamard Inequalities Associated with Exponentially s,m-Convex Functions

open access: yesJournal of Function Spaces, 2020
The aim of this paper is to present the fractional Hadamard and Fejér-Hadamard inequalities for exponentially s,m-convex functions. To establish these inequalities, we will utilize generalized fractional integral operators containing the Mittag-Leffler ...
Shuya Guo   +4 more
doaj   +1 more source

An Improved Convergence Analysis for Decentralized Online Stochastic Non-Convex Optimization [PDF]

open access: yesIEEE Transactions on Signal Processing, 2020
In this paper, we study decentralized online stochastic non-convex optimization over a network of nodes. Integrating a technique called gradient tracking in decentralized stochastic gradient descent, we show that the resulting algorithm, GT-DSGD, enjoys ...
Ran Xin, U. Khan, S. Kar
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy