Granular computing is a novel method to solve complex tasks in the context of big data by simulating human problem-solving thinking, abstracting complex problems and dividing them into several simpler problems (i.e., granulation), which helps to better analyze and solve problems. In order to improve the accuracy of forecasting unemployment rates, this paper introduces the granulation idea of granular computing into the time series analysis of unemployment rates. Therefore, a novel method based on fuzzy information granules (FIGs) and grey system theory, namely FIG-GM(1,1) model, is proposed. This method not only reduces the dimensionality of the problem and computational complexity but also effectively reduces cumulative errors. In empirical analysis, three different performance indicators, mean absolute error (MAE), mean absolute percentage error (MAPE), and root mean squared error (RMSE), and seven comparative models are used to evaluate the forecasting performance of our proposed model. The empirical results indicate that the MAE, MAPE, and RMSE values of the FIG-GM(1,1) model are significantly lower than those of other models, indicating that the FIG-GM(1,1) model has better forecasting performance compared to other models.
Citation: Hong Yang, Jiangli Liu. A novel unemployment rate forecasting method based on fuzzy information granules and GM(1,1) model[J]. AIMS Mathematics, 2024, 9(4): 8689-8711. doi: 10.3934/math.2024421
[1] | Ziqiang Wang, Chunyu Cen, Junying Cao . Topological optimization algorithm for mechanical-electrical coupling of periodic composite materials. Electronic Research Archive, 2023, 31(5): 2689-2707. doi: 10.3934/era.2023136 |
[2] | Yun Ni, Jinqing Zhan, Min Liu . Topological design of continuum structures with global stress constraints considering self-weight loads. Electronic Research Archive, 2023, 31(8): 4708-4728. doi: 10.3934/era.2023241 |
[3] | Furong Xie, Yunkai Gao, Ting Pan, De Gao, Lei Wang, Yanan Xu, Chi Wu . Novel lightweight connecting bracket design with multiple performance constraints based on optimization and verification process. Electronic Research Archive, 2023, 31(4): 2019-2047. doi: 10.3934/era.2023104 |
[4] | Mingtao Cui, Wennan Cui, Wang Li, Xiaobo Wang . A polygonal topology optimization method based on the alternating active-phase algorithm. Electronic Research Archive, 2024, 32(2): 1191-1226. doi: 10.3934/era.2024057 |
[5] | Mingtao Cui, Min Pan, Jie Wang, Pengjie Li . A parameterized level set method for structural topology optimization based on reaction diffusion equation and fuzzy PID control algorithm. Electronic Research Archive, 2022, 30(7): 2568-2599. doi: 10.3934/era.2022132 |
[6] | Xiaoguang Li . Normalized ground states for a doubly nonlinear Schrödinger equation on periodic metric graphs. Electronic Research Archive, 2024, 32(7): 4199-4217. doi: 10.3934/era.2024189 |
[7] | Lei Liu, Jun Dai . Estimation of partially linear single-index spatial autoregressive model using B-splines. Electronic Research Archive, 2024, 32(12): 6822-6846. doi: 10.3934/era.2024319 |
[8] | Yuhai Zhong, Huashan Feng, Hongbo Wang, Runxiao Wang, Weiwei Yu . A bionic topology optimization method with an additional displacement constraint. Electronic Research Archive, 2023, 31(2): 754-769. doi: 10.3934/era.2023037 |
[9] | Xiang Xu, Chuanqiang Huang, Chongchong Li, Gang Zhao, Xiaojie Li, Chao Ma . Uncertain design optimization of automobile structures: A survey. Electronic Research Archive, 2023, 31(3): 1212-1239. doi: 10.3934/era.2023062 |
[10] | Ying Liu, Yanping Chen, Yunqing Huang, Yang Wang . Two-grid method for semiconductor device problem by mixed finite element method and characteristics finite element method. Electronic Research Archive, 2021, 29(1): 1859-1880. doi: 10.3934/era.2020095 |
Granular computing is a novel method to solve complex tasks in the context of big data by simulating human problem-solving thinking, abstracting complex problems and dividing them into several simpler problems (i.e., granulation), which helps to better analyze and solve problems. In order to improve the accuracy of forecasting unemployment rates, this paper introduces the granulation idea of granular computing into the time series analysis of unemployment rates. Therefore, a novel method based on fuzzy information granules (FIGs) and grey system theory, namely FIG-GM(1,1) model, is proposed. This method not only reduces the dimensionality of the problem and computational complexity but also effectively reduces cumulative errors. In empirical analysis, three different performance indicators, mean absolute error (MAE), mean absolute percentage error (MAPE), and root mean squared error (RMSE), and seven comparative models are used to evaluate the forecasting performance of our proposed model. The empirical results indicate that the MAE, MAPE, and RMSE values of the FIG-GM(1,1) model are significantly lower than those of other models, indicating that the FIG-GM(1,1) model has better forecasting performance compared to other models.
A set C⊆R is said to be convex, if
(1−τ)υ1+τυ2∈C,∀υ1,υ2∈C,τ∈[0,1]. |
Similarly, a function Ψ:C→R is said to be convex, if
Ψ((1−τ)υ1+τυ2)≤(1−τ)Ψ(υ1)+τΨ(υ2),∀υ1,υ2∈C,τ∈[0,1]. |
In recent years, the classical concepts of convexity has been extended and generalized in different directions using novel and innovative ideas.
Let us recall first Raina's function Rσρ,λ(z) that it's defined as follows:
Rσρ,λ(z)=Rσ(0),σ(1),…ρ,λ(z):=∞∑k=0σ(k)Γ(ρk+λ)zk,z∈C, | (1.1) |
where ρ,λ>0, with bounded modulus |z|<M, and σ={σ(0),σ(1),…,σ(k),…} is a bounded sequence of positive real numbers. For details, see [1].
Cortez et al. [2] presented a new generalization of convexity class as follows:
Definition 1. [2] Let ρ,λ>0 and σ=(σ(0),…,σ(k),…) be a bounded sequence of positive real numbers. A non-empty set I⊆R is said to be generalized convex, if
υ1+τRσρ,λ(υ2−υ1)∈I,∀υ1,υ2∈I,τ∈[0,1]. |
Definition 2. [2] Let ρ,λ>0 and σ=(σ(0),…,σ(k),…) be a bounded sequence of positive real numbers. A function Ψ:I⊆R→R is said to be generalized convex, if
Ψ(υ1+τRσρ,λ(υ2−υ1))≤(1−τ)Ψ(υ1)+τΨ(υ2),∀υ1,υ2∈I,τ∈[0,1]. |
Quantum calculus is the branch of mathematics (often known as calculus without limits) in which we obtain q-analogues of mathematical objects which can be recaptured by taking q→1−. Interested readers may find very useful details on quantum calculus in [3]. Recently, quantum calculus has been extended to post quantum calculus. In quantum calculus we deal with q-number with one base q however post quantum calculus includes p and q-numbers with two independent variables p and q. This was first considered by Chakarabarti and Jagannathan [4]. Tunç and Gov [5] introduced the concepts of (p,q)-derivatives and (p,q)-integrals on finite intervals as:
Definition 3. [5] Let K⊆R be a non-empty set such that υ1∈K, 0<q<p≤1 and Ψ:K→R be a continuous function. Then, the (p,q)-derivative υ1D(p,q)Ψ(Θ) of Ψ at Θ∈K is defined by
υ1D(p,q)Ψ(Θ)=Ψ(pΘ+(1−p)υ1)−Ψ(qΘ+(1−q)υ1)(p−q)(Θ−υ1),(Θ≠υ1). |
Note that, if we take p=1 in Definition 3, then we get the definition of q-derivative introduced and studied by Tariboon et al. [6].
Definition 4. [5] Let K⊆R be a non-empty set such that υ1∈K, 0<q<p≤1 and Ψ:K→R be a continuous function. Then, the (p,q)-integral on K is defined by
Θ∫υ1Ψ(τ)υ1d(p,q)τ=(p−q)(Θ−υ1)∞∑n=0qnpn+1Ψ(qnpn+1Θ+(1−qnpn+1)υ1) |
for all Θ∈K.
Note that, if we take p=1 in Definition 4, then we get the definition of q-integral on finite interval introduced and studied by Tariboon et al. [6].
Theory of convexity has played very important role in the development of theory of inequalities. A wide class of inequalities can easily be obtained using the convexity property of the functions. In this regard Hermite-Hadamard's inequality is one of the most studied result. It provides us an equivalent property for convexity. This famous result of Hermite and Hadamard reads as: Let Ψ:[υ1,υ2]⊆R→R be a convex function, then
Ψ(υ1+υ22)≤1υ2−υ1υ2∫υ1Ψ(Θ)dΘ≤Ψ(υ1)+Ψ(υ2)2. |
In recent years, several new extensions and generalizations of this classical result have been obtained in the literature. In [7] Dragomir and Agarwal have obtained a new integral identity using the first order differentiable functions:
Lemma 1. [7] Let Ψ:X=[υ1,υ2]⊆R→R be a differentiable function on X∘ (the interior set of X), then
Ψ(υ1)+Ψ(υ2)2−1υ2−υ1∫υ2υ1Ψ(Θ)dΘ=υ2−υ12∫10(1−2τ)Ψ′(τυ1+(1−τ)υ2)dτ. |
Using this identity authors have obtained some new right estimates for Hermite-Hadamard's inequality essentially using the class of first order differentiable convex functions. This idea of Dragomir and Agarwal has inspired many researchers and consequently a variety of new identities and corresponding inequalities have been obtained in the literature using different techniques. Sudsutad et al. [8] and Noor et al. [9] obtained the quantum counterpart of this result and obtained associated q-analogues of trapezium like inequalities. Liu and Zhuang [10] obtained another quantum version of this identity via twice q-differentiable functions and obtained associated q-integral inequalities. Awan et al. [11] extended the results of Dragomir and Agarwal by obtaining a new post-quantum integral identity involving twice (p,q)-differentiable functions and twice (p,q)-differentiable preinvex functions. Du et al. [12] obtained certain quantum estimates on the parameterized integral inequalities and established some applications. Zhang et al. [13] found different types of quantum integral inequalities via (α,m)-convexity. Cortez et al. [14,15] derived some inequalities using generalized convex functions in quantum analysis.
The main objective of this paper is to introduce the notion of generalized strongly convex functions using Raina's function. We derive two new general auxiliary results involving first and second order (p,q)-differentiable functions and Raina's function. Essentially using these identities and the generalized strongly convexity property of the functions, we also derive corresponding new generalized post-quantum analogues of Dragomir-Agarwal's inequalities. In order to discuss the relation with other results, we also discuss some special cases about generalized convex functions. To support our main results, we give applications to special means, to hypergeometric functions, to Mittag-Leffler functions and also to (p,q)-differentiable functions of first and second order that are bounded in absolute value. Finally, some conclusions and future research are provided as well. We hope that the ideas and techniques of this paper will inspire interested readers working in this field.
In this section, we discuss our main results. First, we introduce the class of generalized strongly convex function involving Raina's function.
Definition 5. Let ρ,λ>0 and σ=(σ(0),…,σ(k),…) be a bounded sequence of positive real numbers. A function Ψ:I⊆R→R is called generalized strongly convex, if
Ψ(υ1+τRσρ,λ(υ2−υ1))≤(1−τ)Ψ(υ1)+τΨ(υ2)−cτ(1−τ)(Rσρ,λ(υ2−υ1))2, |
∀c>0,τ∈[0,1] and υ1,υ2∈I.
In this section, we derive two new post-quantum integral identities that will be used in a sequel.
Lemma 2. Let Ψ:X=[υ1,υ1+Rσρ,λ(υ2−υ1)]⊆R→R be a differentiable function and 0<q<p≤1. If υ1D(p,q)Ψ is integrable function on X∘, then
1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q=qRσρ,λ(υ2−υ1)p+q∫10(1−(p+q)τ)υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))0d(p,q)τ. | (2.1) |
Proof. Using the right hand side of (3.3), we have
I:=qRσρ,λ(υ2−υ1)p+qI1, |
and from the definitions of υ1D(p,q), and (p,q)-integral, we get
I1:=∫10(1−(p+q)τ)υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))0d(p,q)τ=∫10(1−(p+q)τ)Ψ(υ1+τpRσρ,λ(υ2−υ1))−Ψ(υ1+qτRσρ,λ(υ2−υ1))(p−q)τRσρ,λ(υ2−υ1)0d(p,q)τ=1Rσρ,λ(υ2−υ1)[∞∑n=0Ψ(υ1+qnpnRσρ,λ(υ2−υ1))−Ψ(υ1+qn+1pn+1Rσρ,λ(υ2−υ1))]−p+qRσρ,λ(υ2−υ1)[∞∑n=0qnpn+1Ψ(υ1+qnpnRσρ,λ(υ2−υ1))−∞∑n=0qnpn+1Ψ(υ1+qn+1pn+1Rσρ,λ(υ2−υ1))]=Ψ(υ1+Rσρ,λ(υ2−υ1))−Ψ(υ1)Rσρ,λ(υ2−υ1)−p+qRσρ,λ(υ2−υ1)[∞∑n=0qnpn+1Ψ(υ1+qnpnRσρ,λ(υ2−υ1))−1q∞∑n=1qnpnΨ(υ1+qnpnRσρ,λ(υ2−υ1))]=Ψ(υ1+Rσρ,λ(υ2−υ1))−Ψ(υ1)Rσρ,λ(υ2−υ1)−p+qqRσρ,λ(υ2−υ1)Ψ(υ1+Rσρ,λ(υ2−υ1))−p+qRσρ,λ(υ2−υ1)∞∑n=0qnpn+1Ψ(υ1+qnpnRσρ,λ(υ2−υ1))+p(p+q)qRσρ,λ(υ2−υ1)∞∑n=0qnpn+1Ψ(υ1+qnpnRσρ,λ(υ2−υ1))=−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)qRσρ,λ(υ2−υ1)+p+qpq(Rσρ,λ(υ2−υ1))2∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)0d(p,q)τ. |
This completes the proof.
The second identity for twice (p,q)-differentiable functions states as follows:
Lemma 3. Let Ψ:X=[υ1,υ1+Rσρ,λ(υ2−υ1)]⊆R→R be a twice differentiable function and 0<q<p≤1. If υ1D2(p,q)Ψ is integrable function on X∘, then
p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ=pq2(Rσρ,λ(υ2−υ1))2p+q∫10τ(1−qτ)υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))0d(p,q)τ. | (2.2) |
Proof. Firstly, applying the definition of υ1D2(p,q) differentiability, we have
υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))=υ1D(p,q)(υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1)))=qΨ(υ1+τp2Rσρ,λ(υ2−υ1))−(p+q)Ψ(υ1+pqτRσρ,λ(υ2−υ1))+pΨ(υ1+τq2Rσρ,λ(υ2−υ1))pq(p−q)2τ2(Rσρ,λ(υ2−υ1))2. |
Now, using the notion of (p,q)-integration, we get
![]() |
After multiplying both sides by pq2(Rσρ,λ(υ2−υ1))2p+q, we obtain our required identity.
We now derive some (p,q)-analogues of Dragomir-Agarwal like inequalities using first order and second order (p,q)-differentiable functions via generalized strongly convex function with modulus c>0. Let us recall the following notion that will be used in the sequel.
[n](p,q):=pn−qnp−q,n∈N,0<q<p≤1. |
Theorem 1. Suppose that all the assumptions of Lemma 2 are satisfied and |υ1D(p,q)Ψ| is generalized strongly convex function, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q[S1|υ1D(p,q)Ψ(υ1)|+S2|υ1D(p,q)Ψ(υ2)|−cS3(Rσρ,λ(υ2−υ1))2], |
where
S1:=2−p−qp+q+(p+q)3−2(p+q)−2+(p+q)2(p+q)2[2](p,q), | (2.3) |
S2:=2−(p+q)2(p+q)2[2](p,q)+(p+q)3−2(p+q)2[3](p,q), | (2.4) |
and
S3:=2−(p+q)2(p+q)2[2](p,q)+(p+q)3+p+q−2−(p+q)4(p+q)3[3](p,q)+(p+q)4−1(p+q)4[4](p,q). | (2.5) |
Proof. From Lemma 2, properties of modulus and using the generalized strongly convexity of |υ1D(p,q)Ψ|, we have
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q∫10|(1−(p+q)τ)||υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|0d(p,q)τ≤qσρ,λ(υ2−υ1)p+q[∫1p+q0(1−(p+q)τ)|υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|0d(p,q)τ+∫11p+q((p+q)τ−1)|υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|0d(p,q)τ]≤qRσρ,λ(υ2−υ1)p+q[∫1p+q0(1−(p+q)τ)[(1−τ)|υ1D(p,q)Ψ(υ1)|+τ|υ1D(p,q)Ψ(υ2)|−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ+∫11p+q((p+q)τ−1)[(1−τ)|υ1D(p,q)Ψ(υ1)|+τ|υ1D(p,q)Ψ(υ2)|−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]. |
After simplification, we obtain our required result.
Corollary 1. Letting c→0+ in Theorem 1, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q[S1|υ1D(p,q)Ψ(υ1)|+S2|υ1D(p,q)Ψ(υ2)|]. |
Theorem 2. Suppose that all the assumptions of Lemma 2 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with m≥1, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1−1m4[S1|υ1D(p,q)Ψ(υ1)|m+S2|υ1D(p,q)Ψ(υ2)|m−cS3(Rσρ,λ(υ2−υ1))2]1m, |
where S1,S2 and S3 are given by (2.3)–(2.5), respectively, and
S4:=2−(p+q)p+q+(p+q)((p+q)2−2)(p+q)2[2](p,q). | (2.6) |
Proof. From Lemma 2, properties of modulus, power-mean inequality and using the generalized strongly convexity of |υ1D(p,q)Ψ|m, we have
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q(∫10|(1−(p+q)τ)|0d(p,q)τ)1−1m×(∫10|(1−(p+q)τ)||υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m=qRσρ,λ(υ2−υ1)p+qS1−1m4[∫1p+q0(1−(p+q)τ)|υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ+∫11p+q((p+q)τ−1)|υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ]1m≤qRσρ,λ(υ2−υ1)p+qS1−1m4[∫1p+q0(1−(p+q)τ)[(1−τ)|υ1D(p,q)Ψ(υ1)|m+τ|υ1D(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ+∫11p+q((p+q)τ−1)[(1−τ)|υ1D(p,q)Ψ(υ1)|m+τ|υ1D(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
After simplification, we obtain our required result.
Corollary 2. Letting c→0+ in Theorem 2, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1−1m4[S1|υ1D(p,q)Ψ(υ1)|m+S2|υ1D(p,q)Ψ(υ2)|m]1m. |
Theorem 3. Suppose that all the assumptions of Lemma 2 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1l5[p+q−1p+q|υ1D(p,q)Ψ(υ1)|m+1p+q|υ1D(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(Rσρ,λ(υ2−υ1))2]1m, |
where
S5:=(p−q)1+q∞∑n=0[(1−(p+q)qnpn+1)l+q((p+q)qnpn+1−1)l]. | (2.7) |
Proof. From Lemma 2, properties of modulus, Hölder's inequality and using the generalized strongly convexity of |υ1D(p,q)Ψ|m, we have
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q(∫10|(1−(p+q)τ)|l0d(p,q)τ)1l×(∫10|υ1D(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m≤qRσρ,λ(υ2−υ1)p+qS1l5[∫10[(1−τ)|υ1D(p,q)Ψ(υ1)|m+τ|υ1D(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
After simplification, we obtain our required result.
Corollary 3. Letting c→0+ in Theorem 3, then
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1l5[p+q−1p+q|υ1D(p,q)Ψ(υ1)|m+1p+q|υ1D(p,q)Ψ(υ2)|m]1m. |
Theorem 4. Suppose that all the assumptions of Lemma 3 are satisfied and |υ1D2(p,q)Ψ| is generalized strongly convex function, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q[S6|υ1D2(p,q)Ψ(υ1)|+S7|υ1D2(p,q)Ψ(υ2)|−cS8(Rσρ,λ(υ2−υ1))2], |
where
S6:=p2−p−q(p+q)(p2+pq+q2)+qp3+pq(p+q)+q3, | (2.8) |
S7:=p3(p2+pq+q2)(p3+pq(p+q)+q3), | (2.9) |
and
S8:=1p+q−1+qp3+pq(p+q)+q3+q[5](p,q). | (2.10) |
Proof. From Lemma 3, properties of modulus and using the generalized strongly convexity of |υ1D2(p,q)Ψ|, we have
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q∫10|τ(1−qτ)||υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|0d(p,q)τ≤pq2(Rσρ,λ(υ2−υ1))2p+q[∫10τ(1−qτ)[(1−τ)|υ1D2(p,q)Ψ(υ1)|+τ|υ1D2(p,q)Ψ(υ2)|−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]. |
This completes the proof.
Corollary 4. Letting c→0+ in Theorem 4, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q[S6|υ1D2(p,q)Ψ(υ1)|+S7|υ1D2(p,q)Ψ(υ2)|]. |
Theorem 5. Suppose that all the assumptions of Lemma 3 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with m≥1, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1−1m9[S6|υ1D2(p,q)Ψ(υ1)|m+S7|υ1D2(p,q)Ψ(υ2)|m−cS8(Rσρ,λ(υ2−υ1))2]1m, |
where S6, S7 and S8 are given by (2.8)–(2.10), respectively, and
S9:=p2(p+q)(p2+pq+q2). | (2.11) |
Proof. From Lemma 3, properties of modulus, power-mean inequality and using the generalized strongly convexity of |υ1D2(p,q)Ψ|m, we have
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(∫10|τ(1−qτ)|0d(p,q)τ)1−1m×(∫10|τ(1−qτ)||υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m=pq2(Rσρ,λ(υ2−υ1))2p+qS1−1m9[∫10τ(1−qτ)|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ]1m≤pq2(Rσρ,λ(υ2−υ1))2p+qS1−1m9[∫10τ(1−qτ)[(1−τ)|υ1D2(p,q)Ψ(υ1)|m+τ|υ1D2(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
This completes the proof.
Corollary 5. Letting c→0+ in Theorem 5, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1−1m9[S6|υ1D2(p,q)Ψ(υ1)|m+S7|υ1D2(p,q)Ψ(υ2)|m]1m. |
Theorem 6. Suppose that all the assumptions of Lemma 3 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l10[p+q−1p+q|υ1D2(p,q)Ψ(υ1)|m+1p+q|υ1D2(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(Rσρ,λ(υ2−υ1))2]1m, |
where
S10:=(p−q)∞∑n=0qnpn+1(qnpn+1−q2n+1p2n+2)l. | (2.12) |
Proof. From Lemma 3, properties of modulus, Hölder's inequality and using the generalized strongly convexity of |υ1D2(p,q)Ψ|m, we have
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(∫10|τ(1−qτ)|l0d(p,q)τ)1l×(∫10|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m=pq2(Rσρ,λ(υ2−υ1))2p+qS1l10[∫10|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ]1m≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l10[∫10[(1−τ)|υ1D2(p,q)Ψ(υ1)|m+τ|υ1D2(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
This completes the proof.
Corollary 6. Letting c→0+ in Theorem 22, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l10[p+q−1p+q|υ1D2(p,q)Ψ(υ1)|m+1p+q|υ1D2(p,q)Ψ(υ2)|m]1m. |
Theorem 7. Suppose that all the assumptions of Lemma 3 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l11[(1[m+1](p,q)−1[m+2](p,q))|υ1D2(p,q)Ψ(υ1)|m+1[m+2](p,q)|υ1D2(p,q)Ψ(υ2)|m−c(1[m+2](p,q)−1[m+3](p,q))(Rσρ,λ(υ2−υ1))2]1l, |
where
S11:=(p−q)∞∑n=0qnpn+1(1−qn+1pn+1)l. | (2.13) |
Proof. From Lemma 3, properties of modulus, Hölder's inequality and using the generalized strongly convexity of |υ1D2(p,q)Ψ|m, we have
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(∫10|(1−qτ)|l0d(p,q)τ)1l×(∫10τm|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m=pq2(Rσρ,λ(υ2−υ1))2p+qS1l11[∫10τm|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ]1m≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l11[∫10τm[(1−τ)|υ1D2(p,q)Ψ(υ1)|m+τ|υ1D2(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
This completes the proof.
Corollary 7. Letting c→0+ in Theorem 7, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l11[(1[m+1](p,q)−1[m+2](p,q))|υ1D2(p,q)Ψ(υ1)|m+1[m+2](p,q)|υ1D2(p,q)Ψ(υ2)|m]1l. |
Theorem 8. Suppose that all the assumptions of Lemma 3 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(1[l+1](p,q))1l[S12|υ1D2(p,q)Ψ(υ1)|m+S13|υ1D2(p,q)Ψ(υ2)|m−cS14(Rσρ,λ(υ2−υ1))2]1m, |
where
S12:=p+q−1p+q∞∑n=0(1−qn+1pn+1)m, | (2.14) |
S13:=(p−q)∞∑n=0q2np2n+2(1−qn+1pn+1)m, | (2.15) |
and
S14:=p2+pq+q2−(p+q)(p+q)(p2+pq+q2)∞∑n=0(1−qn+1pn+1)m. | (2.16) |
Proof. From Lemma 3, properties of modulus, Hölder's inequality and using the generalized strongly convexity of |υ1D2(p,q)Ψ|m, we have
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(∫10τl0d(p,q)τ)1l×(∫10(1−qτ)m|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m=pq2(Rσρ,λ(υ2−υ1))2p+q(1[l+1](p,q))1l(∫10(1−qτ)m|υ1D2(p,q)Ψ(υ1+τRσρ,λ(υ2−υ1))|m0d(p,q)τ)1m≤pq2(Rσρ,λ(υ2−υ1))2p+q(1[l+1](p,q))1l[∫10(1−qτ)m[(1−τ)|υ1D2(p,q)Ψ(υ1)|m+τ|υ1D2(p,q)Ψ(υ2)|m−cτ(1−τ)(Rσρ,λ(υ2−υ1))2]0d(p,q)τ]1m. |
This completes the proof.
Corollary 8. Letting c→0+ in Theorem 8, then
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(1[l+1](p,q))1l[S12|υ1D2(p,q)Ψ(υ1)|m+S13|υ1D2(p,q)Ψ(υ2)|m]1m. |
In this section, we discuss some applications of our main results.
First of all, we recall some previously known concepts regarding special means. For different real numbers υ1<υ2, we have
(1) The arithmetic mean: A(υ1,υ2)=υ1+υ22.
(2) The generalized logarithmic mean: Ln(υ1,υ2)=[υ2n+1−υ1n+1(υ2−υ1)(n+1)]1n,n∈Z∖{−1,0}.
Proposition 1. Assume that all the assumptions of Theorem 1 are satisfied, then the following inequality holds
|2A(pυ2n,qυ1n)p+q−1[n](p,q)Lnn(υ1+p(υ2−υ1),υ1)|≤q(υ2−υ1)p+q[S1|(pυ2+(1−p)υ1)n−(qυ2+(1−q)υ1)n(p−q)(υ2−υ1)|+S2|[n](p,q)υ1n−1|], |
where S1 and S2 are given by (2.3) and (2.4), respectively.
Proof. If we choose υ1D2(p,q)Ψ(x)=xn,Rσρ,λ(υ2−υ1)=υ2−υ1 and c=0 in Theorem 1, we obtain our required result.
Example 1. If we take n=2,υ1=2,υ2=4, p=12 and q=13 in Proposition 1, then we have 0.4<9.42, which shows the validity of the result.
Proposition 2. Assume that all the assumption of Theorem 2 are satisfied, then the following inequality holds
|2A(pυ2n,qυ1n)p+q−1[n](p,q)Lnn(υ1+p(υ2−υ1),υ1)|≤q(υ2−υ1)p+qS1−1m4[S1|(pυ2+(1−p)υ1)n−(qυ2+(1−q)υ1)n(p−q)(υ2−υ1)|m+S2|[n](p,q)υ1n−1|m]1m, |
where S1 and S2 are given by (2.3), (2.4), and S4 is given by (2.6), respectively.
Proof. If we choose υ1D2(p,q)Ψ(x)=xn,Rσρ,λ(υ2−υ1)=υ2−υ1 and c=0 in Theorem 2, then we obtain our required result.
Example 2. If we take n=2,m=2,υ1=2,υ2=4, p=12 and q=13 in Proposition 2, then we have 0.4<11.39, which shows the validity of the result.
From relation (1.1), if we set ρ=1,λ=0 and σ(k)=(ϕ)k(ψ)k(η)k≠0, where ϕ,ψ and η are parameters may be real or complex values and (m)k is defined as (m)k=Γ(m+k)Γ(m) and its domain is restricted as |x|≤1, then we have the following hypergeometric function
R(ϕ,ψ;η,x):=∞∑k=0(ϕ)k(ψ)kk!(η)kxk. |
So using above notations and all the results obtained in this paper, we have the following forms.
Lemma 4. Let Ψ:X=[υ1,υ1+R(ϕ,ψ;η;υ2−υ1)]⊆R→R be a differentiable function and 0<q<p≤1. If υ1D(p,q)Ψ is integrable function on X∘, then
1pR(ϕ,ψ;η;υ2−υ1)∫υ1+pR(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q=qR(ϕ,ψ;η;υ2−υ1)p+q∫10(1−(p+q)τ)υ1D(p,q)Ψ(υ1+τR(ϕ,ψ;η;υ2−υ1))0d(p,q)τ. | (3.1) |
The second identity for twice (p,q)-differentiable functions states as follows:
Lemma 5. Let Ψ:X=[υ1,υ1+R(ϕ,ψ;η;υ2−υ1)]⊆R→R be a twice differentiable function and 0<q<p≤1. If υ1D2(p,q)Ψ is integrable function on X∘, then
![]() |
(3.2) |
Theorem 9. Suppose that all the assumptions of Lemma 4 are satisfied and |υ1D(p,q)Ψ| is generalized strongly convex function, then
|1pR(ϕ,ψ;η;υ2−υ1)∫υ1+pR(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q|≤qR(ϕ,ψ;η;υ2−υ1)p+q[S1|υ1D(p,q)Ψ(υ1)|+S2|υ1D(p,q)Ψ(υ2)|−cS3(R(ϕ,ψ;η;υ2−υ1))2], |
where S1,S2 and S3 are given by (2.3)–(2.5).
Theorem 10. Suppose that all the assumptions of Lemma 4 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with m≥1, then
![]() |
where S1,S2 S3 and S4 are given by (2.3)–(2.6), respectively.
Theorem 11. Suppose that all the assumptions of Lemma 4 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|1pR(ϕ,ψ;η;υ2−υ1)∫υ1+pR(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q|≤qR(ϕ,ψ;η;υ2−υ1)p+qS1l5[p+q−1p+q|υ1D(p,q)Ψ(υ1)|m+1p+q|υ1D(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(R(ϕ,ψ;η;υ2−υ1))2]1m, |
where S5 is given by (2.7).
Theorem 12. Suppose that all the assumptions of Lemma 5 are satisfied and |υ1D2(p,q)Ψ| is generalized strongly convex function, then
|p2Ψ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q−1p2R(ϕ,ψ;η;υ2−υ1)∫υ1+p2R(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(R(ϕ,ψ;η;υ2−υ1))2p+q[S6|υ1D2(p,q)Ψ(υ1)|+S7|υ1D2(p,q)Ψ(υ2)|−cS8(R(ϕ,ψ;η;υ2−υ1))2], |
where S6,S7 and S8 are given as (2.8)–(2.10).
Theorem 13. Suppose that all the assumptions of Lemma 5 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with m≥1, then
![]() |
where S6, S7,S8 and S9 are given by (2.8)–(2.11), respectively.
Theorem 14. Suppose that all the assumptions of Lemma 5 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q−1p2R(ϕ,ψ;η;υ2−υ1)∫υ1+p2R(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(R(ϕ,ψ;η;υ2−υ1))2p+qS1l10[p+q−1p+q|υ1D2(p,q)Ψ(υ1)|m+1p+q|υ1D2(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(R(ϕ,ψ;η;υ2−υ1))2]1m. |
Theorem 15. Suppose that all the assumptions of Lemma 5 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q−1p2R(ϕ,ψ;η;υ2−υ1)∫υ1+p2R(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(R(ϕ,ψ;η;υ2−υ1))2p+qS1l11[(1[m+1](p,q)−1[m+2](p,q))|υ1D2(p,q)Ψ(υ1)|m+1[m+2](p,q)|υ1D2(p,q)Ψ(υ2)|m−c(1[m+2](p,q)−1[m+3](p,q))(R(ϕ,ψ;η;υ2−υ1))2]1l, |
where S11 is given by (2.13).
Theorem 16. Suppose that all the assumptions of Lemma 5 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+R(ϕ,ψ;η;υ2−υ1))+qΨ(υ1)p+q−1p2R(ϕ,ψ;η;υ2−υ1)∫υ1+p2R(ϕ,ψ;η;υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(R(ϕ,ψ;η;υ2−υ1))2p+q(1[l+1](p,q))1l[S12|υ1D2(p,q)Ψ(υ1)|m+S13|υ1D2(p,q)Ψ(υ2)|m−cS14(R(ϕ,ψ;η;υ2−υ1))2]1m, |
where S12,S13,S14 are given by (2.14)–(2.16).
Moreover if we take σ=(1,1,1,…),λ=1 and ρ=ϕ with Re(ϕ)>0 in (1.1), then we obtain well-known Mittag–Leffler function:
Rϕ(x)=∞∑k=01Γ(1+ϕk)xk. |
So using this function and all the results obtained in this paper, we have the following forms.
Lemma 6. Let Ψ:X=[υ1,υ1+Rϕ(υ2−υ1)]⊆R→R be a differentiable function and 0<q<p≤1. If υ1D(p,q)Ψ is integrable function on X∘, then
1pRϕ(υ2−υ1)∫υ1+pRϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q=qRϕ(υ2−υ1)p+q∫10(1−(p+q)τ)υ1D(p,q)Ψ(υ1+τRϕ(υ2−υ1))0d(p,q)τ. | (3.3) |
The second identity for twice (p,q)-differentiable functions states as follows:
Lemma 7. Let Ψ:X=[υ1,υ1+Rϕ(υ2−υ1)]⊆R→R be a twice differentiable function and 0<q<p≤1. If υ1D2(p,q)Ψ is integrable function on X∘, then
p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ=pq2(Rϕ(υ2−υ1))2p+q∫10τ(1−qτ)υ1D2(p,q)Ψ(υ1+τRϕ(υ2−υ1))0d(p,q)τ. | (3.4) |
Theorem 17. Suppose that all the assumptions of Lemma 6 are satisfied and |υ1D(p,q)Ψ| is generalized strongly convex function, then
|1pRϕ(υ2−υ1)∫υ1+pRϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q|≤qRϕ(υ2−υ1)p+q[S1|υ1D(p,q)Ψ(υ1)|+S2|υ1D(p,q)Ψ(υ2)|−cS3(Rϕ(υ2−υ1))2], |
where S1,S2 and S3 are (2.3)–(2.5).
Theorem 18. Suppose that all the assumptions of Lemma 6 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with m≥1, then
|1pRϕ(υ2−υ1)∫υ1+pRϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q|≤qRϕ(υ2−υ1)p+qS1−1m4[S1|υ1D(p,q)Ψ(υ1)|m+S2|υ1D(p,q)Ψ(υ2)|m−cS3(Rϕ(υ2−υ1))2]1m, |
where S1,S2 S3S4p are given by (2.3)–(2.6), respectively.
Theorem 19. Suppose that all the assumptions of Lemma 6 are satisfied and |υ1D(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|1pRϕ(υ2−υ1)∫υ1+pRϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q|≤qRϕ(υ2−υ1)p+qS1l5[p+q−1p+q|υ1D(p,q)Ψ(υ1)|m+1p+q|υ1D(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(Rϕ(υ2−υ1))2]1m, |
where S5 is given by (2.7).
Theorem 20. Suppose that all the assumptions of Lemma 7 are satisfied and |υ1D2(p,q)Ψ| is generalized strongly convex function, then
|p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rϕ(υ2−υ1))2p+q[S6|υ1D2(p,q)Ψ(υ1)|+S7|υ1D2(p,q)Ψ(υ2)|−cS8(Rϕ(υ2−υ1))2], |
where S6,S7 and S8 are given (2.8)–(2.10).
Theorem 21. Suppose that all the assumptions of Lemma 7 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with m≥1, then
|p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rϕ(υ2−υ1))2p+qS1−1m9[S6|υ1D2(p,q)Ψ(υ1)|m+S7|υ1D2(p,q)Ψ(υ2)|m−cS8(Rϕ(υ2−υ1))2]1m, |
where S6, S7,S8 and S9 are given by (2.8)–(2.11), respectively.
Theorem 22. Suppose that all the assumptions of Lemma 7 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rϕ(υ2−υ1))2p+qS1l10[p+q−1p+q|υ1D2(p,q)Ψ(υ1)|m+1p+q|υ1D2(p,q)Ψ(υ2)|m−c(1p+q−1p2+pq+q2)(Rϕ(υ2−υ1))2]1m. |
Theorem 23. Suppose that all the assumptions of Lemma 7 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rϕ(υ2−υ1))2p+qS1l11[(1[m+1](p,q)−1[m+2](p,q))|υ1D2(p,q)Ψ(υ1)|m+1[m+2](p,q)|υ1D2(p,q)Ψ(υ2)|m−c(1[m+2](p,q)−1[m+3](p,q))(Rϕ(υ2−υ1))2]1l, |
where S11 is given by (2.13).
Theorem 24. Suppose that all the assumptions of Lemma 7 are satisfied and |υ1D2(p,q)Ψ|m is generalized strongly convex function with 1l+1m=1, and l,m>0, then
|p2Ψ(υ1+Rϕ(υ2−υ1))+qΨ(υ1)p+q−1p2Rϕ(υ2−υ1)∫υ1+p2Rϕ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rϕ(υ2−υ1))2p+q(1[l+1](p,q))1l[S12|υ1D2(p,q)Ψ(υ1)|m+S13|υ1D2(p,q)Ψ(υ2)|m−cS14(Rϕ(υ2−υ1))2]1m, |
where S12,S13 and S14 are given by (2.14)–(2.16).
In this section, we discuss applications regarding bounded functions in absolute value of the results obtained from our main results. We suppose that the following two conditions are satisfied:
|υ1D(p,q)Ψ|≤Δ1and|υ1D2(p,q)Ψ|≤Δ2, |
and 0<q<p≤1.
Applying the above conditions, we have the following results.
Corollary 9. Under the assumptions of Theorem 1, the following inequality holds
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+q[Δ1(S1+S2)−cS3(Rσρ,λ(υ2−υ1))2]. |
Corollary 10. Under the assumptions of Theorem 2, the following inequality holds
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1−1m4[Δm1(S1+S2)−cS3(Rσρ,λ(υ2−υ1))2]1m. |
Corollary 11. Under the assumptions of Theorem 3, the following inequality holds
|1pRσρ,λ(υ2−υ1)∫υ1+pRσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ−pΨ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q|≤qRσρ,λ(υ2−υ1)p+qS1l5[Δm1−c(1p+q−1p2+pq+q2)(Rσρ,λ(υ2−υ1))2]1m. |
Corollary 12. Under the assumptions of Theorem 4, the following inequality holds
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q[Δ2(S6+S7)−cS8(Rσρ,λ(υ2−υ1))2]. |
Corollary 13. Under the assumptions of Theorem 5, the following inequality holds
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1−1m9[Δm2(S6+S7)−cS8(Rσρ,λ(υ2−υ1))2]1m. |
Corollary 14. Under the assumptions of Theorem 22, the following inequality holds
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l10[Δm2−c(1p+q−1p2+pq+q2)(Rσρ,λ(υ2−υ1))2]1m. |
Corollary 15. Under the assumptions of Theorem 7, the following inequality holds
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+qS1l11[Δm2[m+1](p,q)−c(1[m+2](p,q)−1[m+3](p,q))(Rσρ,λ(υ2−υ1))2]1l. |
Corollary 16. Under the assumptions of Theorem 8, the following inequality holds
|p2Ψ(υ1+Rσρ,λ(υ2−υ1))+qΨ(υ1)p+q−1p2Rσρ,λ(υ2−υ1)∫υ1+p2Rσρ,λ(υ2−υ1)υ1Ψ(τ)υ1d(p,q)τ|≤pq2(Rσρ,λ(υ2−υ1))2p+q(1[l+1](p,q))1l[Δm2(S12+S13)−cS14(Rσρ,λ(υ2−υ1))2]1m. |
In this paper, we introduced the class of generalized strongly convex functions using Raina's function. We have derived two new general auxiliary results involving first and second order (p,q)-differentiable functions and Raina's function. Essentially using these identities and the generalized strongly convexity property of the functions, we also established corresponding new generalized post-quantum analogues of Dragomir-Agarwal's inequalities. We have discussed in details some special cases about generalized convex functions. The efficiency of our main results is also demonstrated with the help of application. We have offered applications to special means, to hypergeometric functions, to Mittag-Leffler functions and also to (p,q)-differentiable functions of first and second order that are bounded in absolute value. We will derive as future works several new post-quantum interesting inequalities using Chebyshev, Markov, Young and Minkowski inequalities. Since the class of generalized strongly convex functions have large applications in many mathematical areas, they can be applied to obtain several results in convex analysis, special functions, quantum mechanics, related optimization theory, and mathematical inequalities and may stimulate further research in different areas of pure and applied sciences. Studies relating convexity, partial convexity, and preinvex functions (as contractive operators) may have useful applications in complex interdisciplinary studies, such as maximizing the likelihood from multiple linear regressions involving Gauss-Laplace distribution. For more details, please see [16,17,18,19,20,21,22,23].
The authors would like to thank the editor and the anonymous reviewers for their valuable comments and suggestions. This research was funded by Dirección de Investigación from Pontificia Universidad Católica del Ecuador in the research project entitled "Some integrals inequalities and generalized convexity" (Algunas desigualdades integrales para funciones con algún tipo de convexidad generalizada y aplicaciones).
The authors declare no conflict of interest.
[1] | A. Badulescu, Unemployment in Romania. A retrospective study, Theor. Appl. Econ., 2 (2006), 71–76. |
[2] |
F. Botha, V. H. Nguyen, Opposite nonlinear effects of unemployment and sentiment on male and female suicide rates: Evidence from Australia, Soc. Sci. Med., 292 (2022), 114536. http://dx.doi.org/10.1016/j.socscimed.2021.114536 doi: 10.1016/j.socscimed.2021.114536
![]() |
[3] |
K. A. Bender, I. Theodossiou, A reappraisal of the unemployment-mortality relationship: Transitory and permanent effects, J. Public Health Pol., 36 (2015), 81–94. http://dx.doi.org/10.1057/jphp.2014.40 doi: 10.1057/jphp.2014.40
![]() |
[4] |
M. Bussiere, M. Fratzscher, Towards a new early warning system of financial crises, J. Int. Money Financ., 25 (2006), 953–973. http://dx.doi.org/10.1016/j.jimonfin.2006.07.007 doi: 10.1016/j.jimonfin.2006.07.007
![]() |
[5] |
F. Cai, M. Wang, Growth and structural changes in employment in transition China, J. Comp. Econ., 38 (2010), 71–81. http://dx.doi.org/10.1016/j.jce.2009.10.006 doi: 10.1016/j.jce.2009.10.006
![]() |
[6] |
T. Chakraborty, A. K. Chakraborty, M. Biswas, S. Banerjee, S. Bhattacharya, Unemployment rate forecasting: A hybrid approach, Comput. Econ., 57 (2021), 183–201. http://dx.doi.org/10.1007/s10614-020-10040-2 doi: 10.1007/s10614-020-10040-2
![]() |
[7] |
A. A. Davidescu, S. A. Apostu, L. A. Stoica, Socioeconomic effects of COVID-19 pandemic: Exploring uncertainty in the forecast of the romanian unemployment rate for the period 2020–2023, Sustainability, 13 (2021), 7078. http://dx.doi.org/10.3390/su13137078 doi: 10.3390/su13137078
![]() |
[8] |
T. Ikeda, K. Sugiyama, J. Aida, T. Tsuboya, K. Osaka, The contextual effect of Area-Level unemployment rate on lower back pain: A multilevel analysis of three consecutive surveys of 962,586 workers in Japan, Int. J. Env. Res. Pub. He., 16 (2019), 4016. http://dx.doi.org/10.3390/ijerph16204016 doi: 10.3390/ijerph16204016
![]() |
[9] | A. Kavkler, D. E. Dncic, A. G. Babucea, I. Bicanic, B. Bohm, D. Tevdovski, et al., Cox regression models for unemployment duration in Romania, Austria, Slovenia, Croatia and Macedonia, Rom. J. Econ. Forecast., 10 (2009), 81–104. |
[10] |
C. Katris, Prediction of unemployment rates with time series and machine learning techniques, Comput. Econ., 55 (2019), 1–34. http://dx.doi.org/10.1007/s10614-019-09908-9 doi: 10.1007/s10614-019-09908-9
![]() |
[11] | S. Kim, K. Koh, S. Boyd, D. Gorinevsky, ℓ1 trend filtering, SIAM Rev., 51 (2009), 339–360. |
[12] |
B. Seetanah, N. U. H. Sookia, P. N. Gonpot, B. Seetanah, Out-of-sample forecasting of the Canadian unemployment rates using univariate models, Appl. Econ. Lett., 24 (2017), 1097–1101. http://dx.doi.org/10.1080/13504851.2016.1257208 doi: 10.1080/13504851.2016.1257208
![]() |
[13] |
A. Lahiani, O. Scaillet, Testing for threshold effect in ARFIMA models: Application to US unemployment rate data, Int. J. Forecast., 25 (2009), 418–428. http://dx.doi.org/10.1016/j.ijforecast.2009.01.004 doi: 10.1016/j.ijforecast.2009.01.004
![]() |
[14] | B. J. Loboa, M. R. Alama, B. E. Whitacreb, Broadband speed and unemployment rates: Data and measurementissues, Telecommun. Policy, 44 (2020), 101829. |
[15] |
F. Li, C. F. Wang, Develop a multi-linear-trend fuzzy information granule based short-term time series forecasting model with k-medoids clustering, Inform. Sciences, 629 (2023), 358–375. http://dx.doi.org/10.1016/j.ins.2023.01.122 doi: 10.1016/j.ins.2023.01.122
![]() |
[16] |
H. Lai, Y. A. Khan, A. Thaljaoui, W. Chammam, S. Z. Abbas, COVID-19 pandemic and unemployment rate: A hybrid unemployment rate prediction approach for developed and developing countries of Asia, Soft Comput., 27 (2023), 615. http://dx.doi.org/10.1007/s00500-021-05871-6 doi: 10.1007/s00500-021-05871-6
![]() |
[17] | T. Y. Lin, Granular computing on binary relations Ⅰ: datamining and neighborhood systems, Ⅱ: Rough setrepresentations and belief functions, rough sets in knowledge discovery, Heidelberg: Physica-Verlag, 1998,107. |
[18] | T. Y. Lin, Granular computing rough set perspective, Newsl. IEEE Comput. Intell. Soc., 2 (2005), 1543. |
[19] |
Z. Li, W. Xu, L. Zhang, R. Y. K. Lau, An ontology-based Web mining method for unemployment rate prediction, Decis. Support Syst., 66 (2014), 114–122. http://dx.doi.org/10.1016/j.dss.2014.06.007 doi: 10.1016/j.dss.2014.06.007
![]() |
[20] |
A. Milner, A. Kavanagh, L. Krnjacki, R. Bentley, A. D. LaMontagne, Area-level unemployment and perceived job insecurity: Evidence from a longitudinal survey conducted in the Australian working-age population, Ann. Occupat. Hyg., 58 (2014), 171–181. http://dx.doi.org/10.1093/annhyg/met066 doi: 10.1093/annhyg/met066
![]() |
[21] |
E. Olmedo, Forecasting spanish unemployment using near neighbour and neural net techniques, Comput. Econ., 43 (2014), 183–197. http://dx.doi.org/10.1007/s10614-013-9371-1 doi: 10.1007/s10614-013-9371-1
![]() |
[22] | Z. Pawlak, Rough sets, Int. J. Comput. Inform. Sci., 11 (1982), 341. |
[23] |
D. J. Roelfs, E. Shor, A. Blank, J. E. Schwartz, Misery loves company? A meta-regression examining aggregate unemployment rates and the unemployment-mortality association, Ann. Epidemiol., 25 (2015), 312–322. http://dx.doi.org/10.1016/j.annepidem.2015.02.005 doi: 10.1016/j.annepidem.2015.02.005
![]() |
[24] |
N. I. Sapankevych, R. Sankar, Time series prediction using support vector machines: A survey, IEEE Comput. Intell. M., 4 (2009), 24–38. http://dx.doi.org/10.1109/MCI.2009.932254 doi: 10.1109/MCI.2009.932254
![]() |
[25] | T. Sun, Y. Liu, Chaotic time series prediction based on fuzzy information granulation and hybrid neural networks, Inform. Control, 2022, 1–8. |
[26] |
S. J. Taylor, B. Letham, Forecasting at scale, Am. Stat., 72 (2018), 37–45. http://dx.doi.org/10.1080/00031305.2017.1380080 doi: 10.1080/00031305.2017.1380080
![]() |
[27] |
Y. Tang, F. Yu, W. Pedrycz, X. Yang, J. Wang, S. Liu, Building trend fuzzy granulation based LSTM recurrent neural network for long-term time series forecasting, IEEE T. Fuzzy Syst., 30 (2022), 1599–1613. http://dx.doi.org/10.1109/TFUZZ.2021.3062723 doi: 10.1109/TFUZZ.2021.3062723
![]() |
[28] |
F. Wang, H. Yang, Expansion of the existence range of the difference between two fuzzy numbers, Pure Math., 11 (2021), 1451–1463. http://dx.doi.org/10.12677/PM.2021.118163 doi: 10.12677/PM.2021.118163
![]() |
[29] | M. C. Wang, F. L. Lin, H. H. Su, P. L. Kuo, Revisiting the relationship between suicide and unemployment in Mexico: Evidence from linear and nonlinear Co-integration, Front. Public Health, 8 (2020), 60. |
[30] | Q. Wang, The effects of unemployment rate on health status of Chinese people, Iran. J. Public Health, 44 (2015), 28–35. |
[31] |
Q. Wang, J. J. Shen, C. Cochran, Unemployment rate, smoking in China: Are they related, Env. Res. Pub. He., 13 (2016), 113. http://dx.doi.org/10.3390/ijerph13010113 doi: 10.3390/ijerph13010113
![]() |
[32] | G. X. Xu, Statistical prediction and decision, Shanghai: Shanghai University of Finance and Economics Press, 2008. |
[33] |
D. S. Yamacli, S. Yamacli, Estimation of the unemployment rate in Turkey: A comparison of the ARIMA and machine learning models including Covid-19 pandemic periods, Heliyon, 9 (2023), e12796. http://dx.doi.org/10.1016/j.heliyon.2023.e12796 doi: 10.1016/j.heliyon.2023.e12796
![]() |
[34] |
X. Yang, F. Yu, W. Pedrycz, Long-term forecasting of time series based on linear fuzzy information granules and fuzzy inference system, Int. J. Approx. Reason., 81 (2017), 1–27. http://dx.doi.org/10.1016/j.ijar.2016.10.010 doi: 10.1016/j.ijar.2016.10.010
![]() |
[35] | L. Zhang, B. Zhang, A quotient space approximationmodel of multiresolution signal analysis, J. Comput. Sci. Technol., 2015, 90. |
[36] | L. A. Zadeh, Fuzzy sets, Inform. Control, 8 (1965), 338. |
[37] |
L. A. Zadeh, Outline of a new approach to the analysis of complex systems and decision processes, IEEE T. Syst., 3 (1973), 28–44. http://dx.doi.org/10.1109/TSMC.1973.5408575 doi: 10.1109/TSMC.1973.5408575
![]() |
[38] |
L. A. Zadeh, Concept of a linguistic variable and itsapplication to approximate reasoning—Ⅱ, Inform. Sciences, 8 (1975), 301–357. http://dx.doi.org/10.1016/0020-0255(75)90046-8 doi: 10.1016/0020-0255(75)90046-8
![]() |
[39] | L. A. Zadeh, Fuzzy sets and information granularity, Adv. Fuzzy Set Th. Appl., 1979, 3–18. |
[40] |
L. A. Zadeh, Fuzzy logic = computing with words, IEEE T. Fuzzy Syst., 4 (1996), 103–111. http://dx.doi.org/10.1109/91.493904 doi: 10.1109/91.493904
![]() |
[41] | L. A. Zadeh, Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzylogic, Fuzzy Set. Syst., 90 (1997), 111–127. |
[42] |
L. A. Zadeh, Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems, Soft Comput., 2 (1998), 23–25. http://dx.doi.org/10.1007/s005000050030 doi: 10.1007/s005000050030
![]() |
[43] |
Y. Q. Zhang, Constructive granular systems with universal approximation and fast knowledge discovery, IEEE T. Fuzzy Syst., 13 (2005), 48–57. http://dx.doi.org/10.1109/TFUZZ.2004.839657 doi: 10.1109/TFUZZ.2004.839657
![]() |
1. | Feiteng Cheng, Qinghai Zhao, Zibin Mao, Fajie Wang, Mechanical Response of Gradient Lattice Structures Based on Topology Optimization, 2024, 26, 1438-1656, 10.1002/adem.202301887 | |
2. | Mingtao Cui, Wennan Cui, Wang Li, Xiaobo Wang, A polygonal topology optimization method based on the alternating active-phase algorithm, 2024, 32, 2688-1594, 1191, 10.3934/era.2024057 | |
3. | Mohammed Hameed Hafeeth, Ying Liu, An efficient volume-preserving binary filter for additive manufacturing in topology optimization, 2024, 0305-215X, 1, 10.1080/0305215X.2024.2382799 | |
4. | Martin Sotola, Pavel Marsalek, David Rybansky, Jan Kopacka, Dusan Gabriel, Ondrej Jezek, Ludek Kovar, Josef Tejc, Miloslav Pasek, Radim Halama, Michal Barnovsky, Application of Surface-Based Smoothing Methods for Topology Optimization Results, 2024, 16, 1758-8251, 10.1142/S1758825124500868 | |
5. | Jianping Zhang, Tao Chen, Haiming Zhang, Shuying Wu, Lei Zhao, Zhijian Zuo, Topology optimization of orthotropic multi-material microstructures with maximum thermal conductivity based on element-free Galerkin method, 2024, 1040-7782, 1, 10.1080/10407782.2024.2379616 | |
6. | Wangyu Liu, Guanghui Huang, Weigui Xie, An efficient cross-platform multi-material topology optimization approach occupying enhanced BESO method, 2024, 0025-6455, 10.1007/s11012-024-01916-w | |
7. | Hongshuo Fan, Jianli Liu, Haobo Zhang, Tao Nie, Jingui Yu, Jianzhong Yang, Zhaohui Xia, Evolutionary topology optimization for elastoplastic structures via isogeometric analysis, 2025, 0305-215X, 1, 10.1080/0305215X.2024.2443738 |