2015
DOI: 10.7153/mia-18-93
|View full text |Cite
|
Sign up to set email alerts
|

Linear operators inequality for $n$-convex functions at a point

Abstract: Abstract. We study necessary and sufficient conditions on linear operators A and B for inequality A f B f to hold for every function f that is n -convex at a point.Mathematics subject classification (2010): 26D99, 26D15.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
25
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6

Relationship

5
1

Authors

Journals

citations
Cited by 19 publications
(25 citation statements)
references
References 0 publications
0
25
0
Order By: Relevance
“…In the present section we formulate related results for the class of n-convex functions at a point introduced by Pečarić et al in [12].…”
Section: Related Inequalities For N-convex Functions At a Pointmentioning
confidence: 99%
“…In the present section we formulate related results for the class of n-convex functions at a point introduced by Pečarić et al in [12].…”
Section: Related Inequalities For N-convex Functions At a Pointmentioning
confidence: 99%
“…3 Related inequalities for n-convex functions at a point In this section we will give related results for the class of n-convex functions at a point introduced in [9]. Definition 3.…”
Section: Theorem 5 Let All the Assumptions Of Theorem 2 Hold With Thmentioning
confidence: 99%
“…A property that explains the name of the class is the fact that a function is n-convex on an interval if and only if it is n-convex at every point of the interval (see [2,9]). Pečarić, Praljak and Witkowski in [9] studied necessary and sufficient conditions on two linear functionals A : C([a, c]) → R and B : C([c, b]) → R so that the inequality A(f ) ≤ B(f ) holds for every function f that is n-convex at c. In this section we will give inequalities of this type for particular linear functionals related to the inequalities obtained in the previous section.…”
Section: Theorem 5 Let All the Assumptions Of Theorem 2 Hold With Thmentioning
confidence: 99%
See 2 more Smart Citations