New Ostrowski type inequalities for generalized s-convex functions with applications to some special means of real numbers and to midpoint formula

Praveen Agarwal1, Miguel Vivas-Cortez2,*, Yenny Rangel-Oliveros2 and Muhammad Aamir Ali3 1 Department of mathematics, Anand International College of Engineering, Jaipur 303012, Rajasthan, India 2 Pontificia Universidad Católica del Ecuador, Facultad de Ciencias Naturales y Exactas, Escuela de Ciencias Fı́sicas y Matemáticas, Sede Quito, Ecuador 3 Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, 210023, China


Introduction
Ostrowski's Inequality. Let f : I ⊂ [0, +∞) → R be a differentiable function on int(I), such that f ∈ L[a, b], where a, b ∈ I with a < b. If | f (x)| ≤ M for all x ∈ [a, b], then the inequality: holds for all x ∈ [a, b]. This inequality was introduced by Alexander Ostrowski in [26], and with the passing of the years, generalizations on the same, involving derivatives of the function under study, have taken place. It is playing a very important role in all the fields of mathematics, especially in the theory approximations. Thus such inequalities were studied extensively by many researches and numerous generalizations, extensions and variants of them for various kind of functions like bounded variation, synchronous, Lipschitzian, monotonic, absolutely continuous and n-times differentiable mappings etc. For recent results and generalizations concerning Ostrowski's inequality, we refer the reader to the recent papers [1,3,4,31,32]. The convex functions play a significant role in many fields, for example in biological system, economy, optimization and so on [2,16,19,24,29,34,39]. And many important inequalities are established for these class of functions . Also the evolution of the concept of convexity has had a great impact in the community of investigators. In recent years, for example, generalized concepts such as s-convexity (see [10]), h-convexity (see [30,33]), m-convexity (see [7,15]), MTconvexity (see [21]) and others, as well as combinations of these new concepts have been introduced.
The role of convex sets, convex functions and their generalizations are important in applied mathematics specially in nonlinear programming and optimization theory. For example in economics, convexity plays a fundamental role in equilibrium and duality theory. The convexity of sets and functions have been the object of many studies in recent years. But in many new problems encountered in applied mathematics the notion of convexity is not enough to reach favorite results and hence it is necessary to extend the notion of convexity to the new generalized notions. Recently, several extensions have been considered for the classical convex functions such that some of these new concepts are based on extension of the domain of a convex function (a convex set) to a generalized form and some of them are new definitions that there is no generalization on the domain but on the form of the definition. Some new generalized concepts in this point of view are pseudo-convex functions [22], quasi-convex functions [5], invex functions [17], preinvex functions [25], B-vex functions [20], Bpreinvex functions [8], E-convex functions [38], Ostrowski Type inequalities for functions whose derivatives are (m, h 1 , h 2 )-convex [35], Féjer Type inequalities for (s, m)-convex functions in the second sense [36] and Hermite-Hadamard-Féjer Type inequalities for strongly (s, m)-convex functions with modulus C, in the second sense [9]. In numerical analysis many quadrature rules have been established to approximate the definite integrals. Ostrowski inequality provides the bounds of many numerical quadrature rules [13].
In this paper we have established new Ostrowski's inequality given by Badreddine Meftah in [23] for s-ϕ-convex functions with f ∈ C n ([a, b]) such that f (n) ∈ L([a, b]) and we give some applications to some special means, the midpoint formula and some examples for the case n = 2.

Preliminaries
Recall that a real-valued function f defined in a real interval J is said to be convex if for all x, y ∈ J and for any t ∈ [0, 1] the inequality holds. If inequality 2.1 is strict when we say that f is strictly convex, and if inequality 2.1 is reversed the function f is said to be concave. In [37] we introduced the notion of s-ϕ-convex functions as a generalization of s-convex functions in first sense.

Main results
In this section, we give some integral approximation of f ∈ C n ([a, b]) such that f (n) ∈ L([a, b]), for n ≥ 1 using the following lemma as the main tool (see [11]).
where the kernel K n : [a, b] 2 → R is given by and n is natural number, n ≥ 1.
Proof. From Lemma 1, properties of modulus, making the changes of variables which is the desired result. The proof is completed.
Remark 2. If we take s = 1 then obtain a result of Meftah B. (see Theorem 2.1 in [23]).
Remark 3. It is important to notice that if s = 1 we have that | f (n) | is convex and then obtain the corollary 2.2 of Meftah see [23].
Proof. Taking ϕ(u, v) = v − u in Theorem 1, we obtain 3.1. Then using the following algebraic inequality for all a, b ≥ 0, and 0 ≤ α ≤ 1 we have (a + b) α ≤ a α + b α , we get the desired result.
Proof. From Lemma 1, properties of modulus, and power mean inequality, we have The proof is completed.
Proof. From Lemma 1, properties of modulus, and power mean inequality, we have which in the desired result.

s-ϕ b -convex function
In this section, using [12] we define s-ϕ b -convex function as generalized form of s-ϕ convex functions [37] and give some results. (ii) f is ϕ-quasiconvex.

Applications for some particular mappings
In this section we give some applications for the special case where n = 2 and the function ϕ( f (x), f (y)) = f (y) − f (x), in this case we have that f is s-convex in the first sense.
Example 4. Let s ∈ (0, 1) and p, q, r ∈ R, we define the function f : [0, +∞) → R as we have that if q ≥ 0 and r ≤ p, then f is s-convex in the first sense (see [18]). If we do ϕ( f (x), f (y)) = f (x) − f (y), then f is s-ϕ-convex, but is not ϕ-convex because f is not convex.
Remark 6. In particular if we choose a = 0 and b = 1, we have for x ∈ [0, 1], we get a graphic representation of the Example 5. Example 6. If we define g(t) = t 4 12 we have that g (t) is 1 2 -ϕ-convex with ϕ(u, v) = 2u + v (see example 1) and by Theorem 1, for a, b ∈ R with a < b and x ∈ [a, b], we have that 3 19 210