2010
DOI: 10.1155/2010/902432
|View full text |Cite
|
Sign up to set email alerts
|

Proof of One Optimal Inequality for Generalized Logarithmic, Arithmetic, and Geometric Means

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…So, by (4) For the case of ϕ, ψ ∈ C − sm (I), since −ϕ, −ψ ∈ C + sm (I), it follows from the above discussion that a function s → x∇ t,−ξ s y is strictly monotone increasing on [0, 1]. However, by Lemma 3-(i), x∇ t,−ξ s y = x∇ t,ξ s y, where t (0, 1) and x, y I with x ≠ y, and then we obtain the desired result.…”
Section: Lemmasmentioning
confidence: 94%
See 1 more Smart Citation
“…So, by (4) For the case of ϕ, ψ ∈ C − sm (I), since −ϕ, −ψ ∈ C + sm (I), it follows from the above discussion that a function s → x∇ t,−ξ s y is strictly monotone increasing on [0, 1]. However, by Lemma 3-(i), x∇ t,−ξ s y = x∇ t,ξ s y, where t (0, 1) and x, y I with x ≠ y, and then we obtain the desired result.…”
Section: Lemmasmentioning
confidence: 94%
“…Remark. It seems that Theorem 3 is slightly related to [3,4] which discuss a comparison between a convex linear combination of the arithmetic and geometric means and the generalized logarithmic mean.…”
Section: ((1 − T)ϕ + Tψ)(z) < (Resp >)(1 − T)ϕ(x) + Tψ(y) = ((1 − T)mentioning
confidence: 99%
“…If we show ( , ) < 0 for , ∈ (0, 1), then ( ) = lim → 1 − ( , ) will be the best function in (8). Simple computations lead to ( , ) < 0 which is equivalent to…”
Section: (10)mentioning
confidence: 98%
“…Recently, means has been the subject of intensive research. In particular, many remarkable inequalities for the Seiffert, logarithmic, and Heronian mean can be found in the literature [1][2][3][4][5][6][7][8][9][10][11]. In the paper [1], authors proved the following optimal inequalities: Let > 0, > 0, ̸ = then ( , ) < ( , ) < ( , ) for ≥ − 2, ≤ 1, = − 2, = 1 are the best constants.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation