scientific article; zbMATH DE number 1013843
Let \(f: [0,b)\to [0,\infty)\) and \(f(0)= 0\). Let \(a_k\in[0, b)\), \(k= 0,\dots,n\), with \(a_0= 0\) and \(\sum^n_{k= 1}| a_k- a_{k-1}|< b\). The main results are the following (Theorem 1 [2]): If \(f\) is convex [concave], then \[ \sum^n_{k= 1}| f(a_k)- f(a_{k- 1})|\leq [\geq] f\Biggl(\sum^n_{k= 1}| a_k- a_{k- 1}|\Biggr). \] For \(f\) a \(\varphi\)-function, the convex variant of the above inequality goes back to \textit{L. Maligranda} and \textit{W. Orlicz} [Monatsh. Math. 104, No. 1, 53-65 (1987; Zbl 0623.26009)]. The convex variant of the inequality is also shown to hold true for real-valued functions of \(r\)-dimensional rectangles which have increasing increments (as defined by \textit{A. M. Russell} [Am. Math. Mon. 87, 39-40 (1980; Zbl 0426.46033)]).
- scientific article; zbMATH DE number 6401091
- On an integral inequality of M. A. Malik
- scientific article; zbMATH DE number 15622
- Some inequalities for functions having Orlicz-convexity
- A generalization of the Maligranda--Orlicz Lemma
- ORLICZ–POINCARÉ INEQUALITIES
- scientific article; zbMATH DE number 2051267
- scientific article; zbMATH DE number 590063
- On Maligranda like inequalities for G-majorization
- scientific article; zbMATH DE number 4058142
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337877)