
In order to approximate the common solution of quasi-nonexpansive fixed point and pseudo-monotone variational inequality problems in real Hilbert spaces, this paper presented three new modified sub-gradient extragradient-type methods. Our algorithms incorporated viscosity terms and double inertial extrapolations to ensure strong convergence and to speed up convergence. No line search methods of the Armijo type were required by our algorithms. Instead, they employed a novel self-adaptive step size technique that produced a non-monotonic sequence of step sizes while also correctly incorporating a number of well-known step sizes. The step size was designed to lessen the algorithms' reliance on the initial step size. Numerical tests were performed, and the results showed that our step size is more effective and that it guarantees that our methods require less execution time. We stated and proved the strong convergence of our algorithms under mild conditions imposed on the control parameters. To show the computational advantage of the suggested methods over some well-known methods in the literature, several numerical experiments were provided. To test the applicability and efficiencies of our methods in solving real-world problems, we utilized the proposed methods to solve optimal control and image restoration problems.
Citation: Austine Efut Ofem, Jacob Ashiwere Abuchu, Godwin Chidi Ugwunnadi, Hossam A. Nabwey, Abubakar Adamu, Ojen Kumar Narain. Double inertial steps extragadient-type methods for solving optimal control and image restoration problems[J]. AIMS Mathematics, 2024, 9(5): 12870-12905. doi: 10.3934/math.2024629
[1] | Lamya Almaghamsi, Aeshah Alghamdi, Abdeljabbar Ghanmi . Existence of solution for a Langevin equation involving the ψ-Hilfer fractional derivative: A variational approach. AIMS Mathematics, 2025, 10(1): 534-550. doi: 10.3934/math.2025024 |
[2] | Arjumand Seemab, Mujeeb ur Rehman, Jehad Alzabut, Yassine Adjabi, Mohammed S. Abdo . Langevin equation with nonlocal boundary conditions involving a ψ-Caputo fractional operators of different orders. AIMS Mathematics, 2021, 6(7): 6749-6780. doi: 10.3934/math.2021397 |
[3] | Sotiris K. Ntouyas, Bashir Ahmad, Jessada Tariboon . Nonlocal integro-multistrip-multipoint boundary value problems for ¯ψ∗-Hilfer proportional fractional differential equations and inclusions. AIMS Mathematics, 2023, 8(6): 14086-14110. doi: 10.3934/math.2023720 |
[4] | Karim Guida, Lahcen Ibnelazyz, Khalid Hilal, Said Melliani . Existence and uniqueness results for sequential ψ-Hilfer fractional pantograph differential equations with mixed nonlocal boundary conditions. AIMS Mathematics, 2021, 6(8): 8239-8255. doi: 10.3934/math.2021477 |
[5] | Sunisa Theswan, Sotiris K. Ntouyas, Jessada Tariboon . Coupled systems of ψ-Hilfer generalized proportional fractional nonlocal mixed boundary value problems. AIMS Mathematics, 2023, 8(9): 22009-22036. doi: 10.3934/math.20231122 |
[6] | Thabet Abdeljawad, Pshtiwan Othman Mohammed, Hari Mohan Srivastava, Eman Al-Sarairah, Artion Kashuri, Kamsing Nonlaopon . Some novel existence and uniqueness results for the Hilfer fractional integro-differential equations with non-instantaneous impulsive multi-point boundary conditions and their application. AIMS Mathematics, 2023, 8(2): 3469-3483. doi: 10.3934/math.2023177 |
[7] | Zohreh Heydarpour, Maryam Naderi Parizi, Rahimeh Ghorbnian, Mehran Ghaderi, Shahram Rezapour, Amir Mosavi . A study on a special case of the Sturm-Liouville equation using the Mittag-Leffler function and a new type of contraction. AIMS Mathematics, 2022, 7(10): 18253-18279. doi: 10.3934/math.20221004 |
[8] | Weerawat Sudsutad, Chatthai Thaiprayoon, Sotiris K. Ntouyas . Existence and stability results for ψ-Hilfer fractional integro-differential equation with mixed nonlocal boundary conditions. AIMS Mathematics, 2021, 6(4): 4119-4141. doi: 10.3934/math.2021244 |
[9] | Zheng Kou, Saeed Kosari . On a generalization of fractional Langevin equation with boundary conditions. AIMS Mathematics, 2022, 7(1): 1333-1345. doi: 10.3934/math.2022079 |
[10] | Muath Awadalla, Manigandan Murugesan, Subramanian Muthaiah, Bundit Unyong, Ria H Egami . Existence results for a system of sequential differential equations with varying fractional orders via Hilfer-Hadamard sense. AIMS Mathematics, 2024, 9(4): 9926-9950. doi: 10.3934/math.2024486 |
In order to approximate the common solution of quasi-nonexpansive fixed point and pseudo-monotone variational inequality problems in real Hilbert spaces, this paper presented three new modified sub-gradient extragradient-type methods. Our algorithms incorporated viscosity terms and double inertial extrapolations to ensure strong convergence and to speed up convergence. No line search methods of the Armijo type were required by our algorithms. Instead, they employed a novel self-adaptive step size technique that produced a non-monotonic sequence of step sizes while also correctly incorporating a number of well-known step sizes. The step size was designed to lessen the algorithms' reliance on the initial step size. Numerical tests were performed, and the results showed that our step size is more effective and that it guarantees that our methods require less execution time. We stated and proved the strong convergence of our algorithms under mild conditions imposed on the control parameters. To show the computational advantage of the suggested methods over some well-known methods in the literature, several numerical experiments were provided. To test the applicability and efficiencies of our methods in solving real-world problems, we utilized the proposed methods to solve optimal control and image restoration problems.
There are many life-threatening diseases, out of which Malaria is one of them that is produced through the parasite known as Plasmodium that transmits to humans with the infected anopheles mosquito bite [1,2,3]. People with malaria are infected by the Protozoan parasite, which grows within the cells of red blood and spreads the illness. There are four Plasmodia species that can become the reason of infection, known as oval, falciparum, malaria, and vivax, while the two other most widespread Plasmodium species are falciparum and vivax [4]. Malaria affects lots of people each year, mainly in South Asia, Africa, and South America. It becomes the major reason of death and illness in various developing regions, specifically young children, and pregnant women. The main symptoms of malaria are fever, muscle pain, and headache. Malaria can progress promptly, possibly severe anemia, lung problems, and even cause death. There are various effective tactics that proposed the World Health Organization (WHO) to treat and prevent this dangerous disease. Some of them are indoor spraying, pesticide-treated bed nets, and some antimalarial medications. The vector control systems can be applied to lessen the poisoned mosquito population. In general, malaria is a substantial global health task, which needs a comprehensive approach for its cure by using the strategies of vector control and early identification for its treatment.
Malaria is a dynamic and complicated disease, which is considered difficult to present its model mathematically. The malaria parasite's life cycle is complex due to numerous phases of development both in mosquito vector and human host. These points are prompted by numerous features, e.g., mosquito actions, host immunity, and environmental environments that is used to make difficult the disease dynamics to predict and understand. The intricacy of the virus's spread dynamics is one of the main problems with malaria modelling. Malaria spread is influenced by numerous interrelated influences, e.g., the mosquito vector density, the host immunity degree, and the accessibility of efficient mediations. The relations between these aspects indicate the nonlinearity and hard to capture using the mathematical systems [5]. However, the mathematical malaria disease model based on the pesticides and medication (MDMPM) is presented, which is categorized in four human (susceptible, exposed, infected, recovered) and two vector (susceptible, infected) classes. The pathogen infects the population of host then the individuals are categorized into groups based on the parasites number and virus types. Kermack-McKendrick [6] proposed the mathematical SEIRSI model based on the population of human/vector groups. The nonlinear dynamics of the SEIRSI model is presented as [7]:
S′h(x)=αh+β1Rh(x)−γ1ψIh(x)Sh(x)−γ2ξIm(x)Sh(x)−(δ1+ηh)Sh(x),E′h(x)=γ2ξIm(x)Sh(x)+γ1ψIh(x)Sh(x)−(β2+δ2+ηh)Eh(x),I′h(x)=β2Eh(x)−(ϵ+pυ+ηh)Ih(x),R′h(x)=δ1Sh(x)+υpIh(x)+δ2Eh(x)−(β1+ηh)Rh(x),S′m(x)=αm−(σ+ηm)Sm(x)−γ3eSm(x)Ih(x),I′m(x)=γ3eIh(x)Sm(x)−(σ+ηm)Im(x). | (1) |
The compartmental illustration of the SEIRSI model based on the MDMPM is shown in Figure 1, while the description of each parameter is given in Table 1.
Parameters | Details |
β1 | Susceptible form of recovered individuals |
αm | Newborn mosquitoes transfer rate into Sm |
αh | Newborns ratio to enter in Sh |
γ1 | Transfer ratio of illness from one affected to susceptible people |
ψ | Transfusions rate of average blood with stable time in Ih and Sh |
β2 | Exposed to infected infection rate in people |
ξ | Infected mosquito susceptible bites using fixed time |
γ3 | Rate of Mosquitos infection |
γ2 | Disease transfer through infected (mosquito) to susceptible (individual) |
ηh | People natural rate of death |
δ2 | Exposed recovered population |
δ1 | Susceptible recovered population |
p | Rate of humans heal |
ε | Infected human death due to disease |
ηm | Mosquitos' natural death |
υ | Anti-malarial prescriptions |
e | Bites Sm using the infected humans |
σ | Expires sections using spraying for Sm and Im |
x | Time |
There are various deterministic and conventional numerical schemes that have been presented to solve the biological models, including the wavelet Bernstein scheme that has been presented to solve the epidemic SIR fractional kind of infectious disease model [8], Laplace method is applied for the fractional epidemic system of born vector disease [9], q-homotopy transform technique is proposed to solve the fractional Schistosomiasis disease model [10,11], a theoretic investigation is presented based on the impacts of vector-virus transmission mechanism [12], a collocation technique with shifted Chebyshev polynomials is applied to solve the fractional order diseased model of Rubella ailment [13], an analytical computational approach is provided for the inflammatory atherosclerosis disease system [14], the differential stomach and coronavirus models have been discussed numerically by applying the Adam method [15,16] and the design of a numerical method is presented for the maturing communication in population and epidemic models [17]. Some more deterministic procedures that have been applied to solve different dynamical models are presented in [18,19,20,21,22].
All mentioned schemes have their individual strength, and demerits, however the stochastic solvers have never been tested before for the nonlinear dynamics of the MDMPM. The current study is related to the numerical solutions of the MDMPM through the stochastic procedures using the scale conjugate gradient neural networks (SCJGNNs). In recent years, the stochastic computing paradigms have been proposed in various applications, e.g., eye surgery differential systems [23,24], food chain systems [25,26], smoking dynamical systems [27], models arising in biological applications, [28,29], thermal explosion singular systems [30,31], and many more [32,33,34,35,36,37,38,39,40,41,42,43]. Based on these noteworthy applications of neuro-computing paradigm, the authors are motivated to present the numerical solutions of the malaria disease model of pesticides and medication (MDMPM) with stochastic framework of scale conjugate gradient neural networks (SCJGNNs). The purpose of this work is to provide a stochastic framework based on the SCJGNNs for solving the mathematical model representing MDMPM dynamics.
The contributions, insights and innovative aspects of the current scheme is portrayed in terms of salient features as follows:
• A novel design of the stochastic framework via SCJGNNs is introduced/presented to get the numerical results/outcomes of the nonlinear dynamics of governing mathematical model of MDMPM.
• The capability and knacks of Runge-Kutta solver is exploited/developed to formulate the target datasets for different scenario of MDMPM system that are used for the testing, and training procedure of the networks via SCJGNNs.
• The exactness of the stochastic SCJGNNs is attained/verified/validated through the overlapping of the results with standard counterparts having very small magnitude of absolute error (AE).
• The reliable matching of the numerical results, a strong arrangement using the benchmark outputs along with consistent statistical performance indices further prove the importance/significance/role of the SCJGNNs to solve the variant of MDMPM models.
The remaining paper is presented as: Proposed SCJGNNs design is shown in Section 2, Sect 3 presents the numerical results, and the conclusions are discussed in the final section.
The current section is used to design the computing SCJGNNs structure to solve the MDMPM in two steps, including the detail of designed SCJGNNs performances along with its execution. The designed SCJGNNs is presented in Figure 2. In the 1st phase of Figure 2, the nonlinear mathematical system is illustrated, the stochastic methodology using the SCJGNNs is provided in the 2nd phase of Figure 2, while some results are presented in the last phase of Figure 2. The performances using the multi-layers network based on the structure of single neuron is illustrated in Figure 3.
The computing SCJGNNs approach for solving the MDMPM is executed using the command 'nftool' in software 'MATLAB', n-folded cross authentication, layers (output/hidden/input) structure, epochs are taken maximum 1000, fifteen hidden neurons, transfer function log-sigmoid, stopping standards, SCJG algorithm, tolerances, and step size. The label statics and input/target training are achieved using the basic outputs by taking the statics of validation (12%), testing (10%), and training (78%) for the MDMPM.
The designed computing SCJGNNs for the solutions of the MDMPM is performed by using 15 neurons, which have been validated through the best values of underfitting and overfitting based on the authorization and training at epochs 100, 86 and 69. For small neurons, the premature convergence (under fitting) problem is faced, while similar precision by using higher intricacy (overfitting issue) is noticed by taking higher neurons. The trials have been taken for the validation (12%), testing (10%), and training (78%) to solve the MDMPM. By taking a smaller data training, like 40% to 60%, the MSE values for testing 30% to 40% increase and generally poor presentations have been observed. On the other hand, if the training statics is almost designated > 90% and 5% for both testing and certification, the procedure's correctness improves marginally by choosing the label static, which presents the bias and targets input, but stochastic procedure's strength is not severely established for unbiased statics exclusive based targets information. The proposed values are performed on the input [0, 1] by applying the stochastic SCJGNNs procedure for the numerical performances of the MDMPM. The neuron structure using the input, output and hidden layers is shown in Figure 4.
The numerical solution for three different cases of the MDMPM by applying the computing procedures based on the SCJGNNs is presented in this section.
Case 1: Consider the values ψ=0.038, αh=0.027, γ1=0.020, ξ=0.13, β1=1730, γ2=0.010, δ1=0.001, ηh=0.0004, δ2=0.001, p=0.611, β2=0.001, ε=0.05, υ=0.01, e=0.022, αm=0.13, γ3=0.072, Sh(0)=0.01, Eh(0)=0.02, Ih(0)=0.03, Rh(0)=0.04, Sm(0)=0.05, and Im(0)=0.06 in system (1), which is shown as:
{S′h(x)=0.027+0.0014Rh(x)−(0.00076Ih(x)+0.0014+0.0013Im(x))Sh(x),(Sh)0=0.01,E′h(x)=(0.00076Ih(x)+0.0013Im(x))Sh(x)−0.0024Eh(x),(Eh)0=0.02,I′h(x)=−0.00752Ih(x)+0.001Eh(x),(Ih)0=0.03,R′h(x)=0.00611Ih(x)−0.00177Rh(x)+0.001Eh(x)+0.001Sh(x),(Rh)0=0.04,S′m(x)=0.13−0.05Sm(x)−0.001584Ih(x)Sm(x),(Sm)0=0.05,I′m(x)=0.001584Sm(x)Ih(x)−0.05Im(x),(Im)0=0.06. | (2) |
Case 2: Consider the parameter values ψ=0.038, αh=0.027, γ1=0.020, ξ=0.13, β1=1730, γ2=0.010, δ1=0.001, ηh=0.0004, δ2=0.001, p=0.611, β2=0.001, ε=0.05, υ=0.01, e=0.022, αm=0.13, γ3=0.072, Sh(0)=0.02, Eh(0)=0.03, Ih(0)=0.04, Rh(0)=0.05, Sm(0)=0.06, and Im(0)=0.07 in system (1) that is given as:
{S′h(x)=0.027+0.0014Rh(x)−(0.00076Ih(x)+0.0014+0.0013Im(x))Sh(x),(Sh)0=0.02,E′h(x)=(0.00076Ih(x)+0.0013Im(x))Sh(x)−0.0024Eh(x),(Eh)0=0.03,I′h(x)=−0.00752Ih(x)+0.001Eh(x),(Ih)0=0.04,R′h(x)=0.00611Ih(x)−0.00177Rh(x)+0.001Eh(x)+0.001Sh(x),(Rh)0=0.05,S′m(x)=0.13−0.05Sm(x)−0.001584Ih(x)Sm(x),(Sm)0=0.06,I′m(x)=0.001584Sm(x)Ih(x)−0.05Im(x),(Im)0=0.07. | (3) |
Case 3: Consider ψ=0.038, αh=0.027, γ1=0.020, ξ=0.13, β1=1730, γ2=0.010, δ1=0.001, ηh=0.0004, δ2=0.001, p=0.611, β2=0.001, ε=0.05, υ=0.01, e=0.022, αm=0.13, γ3=0.072, Sh(0)=0.03, Eh(0)=0.04, Ih(0)=0.05, Rh(0)=0.06, Sm(0)=0.07, and Im(0)=0.08 in system (1), given as:
{S′h(x)=0.027+0.0014Rh(x)−(0.00076Ih(x)+0.0014+0.0013Im(x))Sh(x),(Sh)0=0.03,E′h(x)=(0.00076Ih(x)+0.0013Im(x))Sh(x)−0.0024Eh(x),(Eh)0=0.04,I′h(x)=−0.00752Ih(x)+0.001Eh(x),(Ih)0=0.05,R′h(x)=0.00611Ih(x)−0.00177Rh(x)+0.001Eh(x)+0.001Sh(x),(Rh)0=0.06,S′m(x)=0.13−0.05Sm(x)−0.001584Ih(x)Sm(x),(Sm)0=0.07,I′m(x)=0.001584Sm(x)Ih(x)−0.05Im(x),(Im)0=0.08. | (4) |
The plots of the estimated results based on the numerical SCJGNNs procedure for solving the MDMPM are shown in Figures 5 to 9. Figure 5 presents the best validation measures and state transitions for the nonlinear dynamics of the MDMPM through the stochastic computing SCJGNNs scheme. The values of the mean square error (MSE) and the state of transition values are depicted in Figure 5. The computed performances of MSE using the best curves plots, certification, and training are provided in Figure 5(a-c) and the SoT measures are portrayed in Figure 5(d-f). The best solution performances of the MDMPM are shown at epochs 100, 86 and 69, which are found around 1.69774 ×10−07, 1.4324 × 10−07 and 3.5876 × 10−07. It indicates that convergence through the MSE is observed based on dataset of training, testing and certification. It is also observed that by updating the epochs, the authentications, training, and testing graphs lead to steady-state position up to 10-07. The gradient curves by applying the process of SCJGNNs to solve the MDMPM are calculated as 1.4161×10-06, 8.1804 × 10−07 and 2.9486 × 10−06. These graphic curves indicate the precision, exactness, and convergence by using the SCJGNNs procedure for the MDMPM. An error gradient presents the direction and magnitude that is calculated by the designed neural network for updating the weights in the proper amount/direction. In neural network fitting, the process of backpropagation is used to compute the loss function gradient. Mu is the used for the network's training for the momentum parameter, which includes the updated weight expressions to avoid the local minimum issues. It is observed that the network can stuck sometimes to the local minimum, which does not perform the convergence. In addition, Mu shows the control parameter based on that scheme that is used in the neural network's training.
Figure 6(a to c) presents the curves of fitting for the nonlinear MDMPM, which certifies the comparison of the results. Figure 6(d-f) signifies the error histogram (EH) values for the MDMPM by applying the computing SCJGNNs. The construction of EH is used to test the errors of the targeted and predicted values after the designed artificial neural network training. These errors present that how predicted measures contrast from the targeted values. These values based on the EH are obtained as 1.95 × 10−05, 8.64 × 10−05 and −5.90 × 10−06 for respective dynamics of the MDMPM. Figures 7 to 9 present the correlation values for the MDMPM using the SCJGNNs. These measures based on the determination coefficient R2 are found as 1 for each case of the MDMPM. The graphs of substantiation, testing, and training verify the correctness of the MDMPM using the numerical stochastic SCJGNNs procedure. The values of MSE convergence using the train, epochs, certification, backpropagation, test, and intricacy are tabulated in Table 2. The complexity measures using the SCJGNNs for the MDMPM are performed to authenticate the intricacy based on the network's training, i.e., epoch execution.
Case | MSE for instances of sampling | Gradient | Performance | Epoch | Time | ||
Test | validation | Train | |||||
I | 2.745×10−07 | 1.697 ×10−07 | 2.366×10−07 | 1.42×10−06 | 2.26×10−07 | 100 | 2 Sec |
II | 1.795×10−07 | 1.432×10−07 | 1.920×10−07 | 8.18×10−07 | 1.91×10−07 | 86 | 2 Sec |
III | 5.112×10−07 | 3.038×10−07 | 3.678×10−07 | 2.94×10−06 | 2.09×10−07 | 69 | 2 Sec |
Figures 10 and 11 present the comparison graphs and AE using the obtained and source statics for the MDMPM. It is demonstrated that the source and calculated outcomes of the MDMPM precisely coincided. Figure 10 represents the AE graphs for each category of the MDMPM. For the first class, the AE lies as 10−03 to 10−05 for case I and III and 10−02 to 10−04 for case II. These values for the 2nd category of the MDMPM are found around 10−05 to 10−06, 10−04 to 10−06 and 10−03 to 10−05 for cases I, II and III. The AE measures for the 3rd dynamics of the MDMPM lie as 10−04 to 10−07, 10−03 to 10−05 and 10−03 to 10−06 for respective cases. These values for the 4th class of the MDMPM are calculated as 10−03 to 10−05 for case I and for case II and III, these AE are found as 10−03 to 10−04. The AE values for the 5th and 6th dynamics are found as 10−03 to 10−05 for each case of the model. These reduceable AE measures provides the accuracy of the scheme for the MDMPM.
The stochastic numerical performances of the malaria disease using the pesticides and medication have been presented in this study. The populations-based host and vector are divided in the mathematical classification of the malaria using the pesticides and medication. Some conclusions of this work are reported as:
• The stochastic scale conjugate gradient neural network framework has been designed successfully for the numerical malaria disease model.
• The neural network procedure is presented by using fifteen neurons along with the log-sigmoid transfer function in the hidden layers to solve the model.
• The supervised neural networks process using the data as for validation 12%, testing 10%, and training 78% is presented for the numerical solutions of the system.
• The accuracy of the proposed stochastic scheme is examined through the overlapping of the achieved obtained and Runge-Kutta source solutions.
• The negligible performances of AE indicate the exactness of the computing stochastic approach.
• The consistency and trustworthiness of the designed procedure are assessed through the correlation, histogram curves, regression, and functional fitness process to solve the MDMPM.
• The perks/advantages of the proposed stochastic SCJGNNs procedure includes simplicity of the concept and understanding, straightforwardness in implementations and execution, provision of outcome on continuous domain, expandability and applicability.
The limitation/disadvantage of the stochastic SCJGNNs paradigm is the issue of trapping in local minima for scale conjugate gradient methodology while training of the weights of the networks, however, the said limitation is rectified by exploited heuristic global search methodologies in future by the interested readers. Additionally, in future, the designed SCJGNNs procedure can be explored/implemented for different applications of the nonlinear mathematical models arising in the field of computational fluid mechanics.
The authors declare that they have no conflict of interest
Manal Alqhtani: Conceptualization, methodology, validation, Writing-original draft preparation, writing-review; J.F. Gómez-Aguilar: Conceptualization, methodology, validation, investigation, Writing-original draft preparation, writing-review; Khaled M. Saad: Conceptualization, methodology, validation, writing-review and editing; Zulqurnain Sabir: Validation, investigation, Writing-original draft preparation, writing-review; Eduardo Pérez-Careta: Validation, formal analysis, investigation. All authors have read and agreed to the published version of the manuscript.
The authors are thankful to the Deanship of Scientific Research at Najran University for funding this work under the General Research Funding program grant code (NU/RG/SERC/12/22).
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
[1] |
J. Abuchu, A. Ofem, G. Ugwunnadi, O. Narain, A. Hussain, Hybrid alternated inertial projection and contraction algorithm for solving bilevel variational inequality problems, J. Math., 2023 (2023), 3185746. http://dx.doi.org/10.1155/2023/3185746 doi: 10.1155/2023/3185746
![]() |
[2] |
A. Adamu, A. Adam, Approximation of solutions of split equality fixed point problems with applications, Carpathian J. Math., 37 (2021), 381–392. http://dx.doi.org/10.37193/CJM.2021.03.02 doi: 10.37193/CJM.2021.03.02
![]() |
[3] |
H. Bauschke, P. Combettes, A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces, Math. Oper. Res., 26 (2001), 248–264. http://dx.doi.org/10.1287/moor.26.2.248.10558 doi: 10.1287/moor.26.2.248.10558
![]() |
[4] | A. Bressan, B. Piccoli, Introduction to the mathematical theory of control, San Francisco: American Institute of Mathematical Sciences, 2007. |
[5] |
G. Cai, Y. Shehu, O. Iyiola, Inertial Tseng's extragradient method for solving variational inequality problems of pseudo-monotone and non-Lipschitz operators, J. Ind. Manag. Optim., 18 (2022), 2873–2902. http://dx.doi.org/10.3934/jimo.2021095 doi: 10.3934/jimo.2021095
![]() |
[6] |
Y. Censor, A. Gibali, S. Reich, The subgradient extragradient method for solving variational inequalities Hilbert space, J. Optim. Theory Appl., 148 (2011), 318–335. http://dx.doi.org/10.1007/s10957-010-9757-3 doi: 10.1007/s10957-010-9757-3
![]() |
[7] |
Y. Censor, A. Gibali, S. Reich, Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space, Optim. Method. Softw., 26 (2011), 827–845. http://dx.doi.org/10.1080/10556788.2010.551536 doi: 10.1080/10556788.2010.551536
![]() |
[8] | C. Chidume, A. Adamu, L. Okereke, Strong convergence theorem for some nonexpansive-type mappings in certain Banach spaces, Thai J. Math., 18 (2020), 1537–1548. |
[9] | C. Chidume, A. Adamu, Solving split equality fixed point problem for quasi-phi-nonexpansive mappings, Thai J. Math., 19 (2021), 1699–1717. |
[10] |
P. Cholamjiak, D. Hieu, Y. Cho, Relaxed forward-backward splitting methods for solving variation inclusions and aplications, J. Sci. Comput., 88 (2021), 85. http://dx.doi.org/10.1007/s10915-021-01608-7 doi: 10.1007/s10915-021-01608-7
![]() |
[11] |
Y. Censor, A. Gibali, S. Reich, Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space, Optimization, 61 (2012), 1119–1132. http://dx.doi.org/10.1080/02331934.2010.539689 doi: 10.1080/02331934.2010.539689
![]() |
[12] | G. Fichera, Sul problema elastostatico di signorini con ambigue condizioni al contorno, Atti Accad. Naz. Lincei, VIII. Ser., Rend., Cl. Sci. Fis. Mat. Nat, 34 (1963), 138–142. |
[13] |
A. Gibali, D. Thong, Tseng type-methods for solving inclusion problems and its applications, Calcolo, 55 (2018), 49. http://dx.doi.org/10.1007/s10092-018-0292-1 doi: 10.1007/s10092-018-0292-1
![]() |
[14] |
E. Godwin, T. Alakoya, O. Mewomo, J. Yao, Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems, Appl. Anal., 102 (2023), 4253–4278. http://dx.doi.org/10.1080/00036811.2022.2107913 doi: 10.1080/00036811.2022.2107913
![]() |
[15] | K. Goebel, S. Reich, Uniform convexity, hyperbolic geometry, and nonexpansive mappings, New York: Marcel Dekker, 1983. |
[16] |
B. He, A class of projection and contraction methods for monotone variational inequalities, Appl. Math. Optim., 35 (1997), 69–76. http://dx.doi.org/10.1007/BF02683320 doi: 10.1007/BF02683320
![]() |
[17] |
C. Izuchukwu, S. Reich, Y. Shehu, A. Taiwo, Strong convergence of forward-reflected-backward splitting methods for solving monotone inclusions with applications to image restoration and optimal control, J. Sci. Comput., 94 (2023), 73. http://dx.doi.org/10.1007/s10915-023-02132-6 doi: 10.1007/s10915-023-02132-6
![]() |
[18] |
L. Jolaoso, A. Taiwo, T. Alakoya, O. Mewomo, A self adaptive inertial subgradient extragradient algorithm for variational inequality and common fixed point of multivalued mappings in Hilbert spaces, Demonstr. Math., 52 (2019), 183–203. http://dx.doi.org/10.1515/dema-2019-0013 doi: 10.1515/dema-2019-0013
![]() |
[19] | I. Karahan, L. Jolaso, Athree steps iterative process for approximating the fixed points of multivalued generalized α-nonexpansive mappings in uniformly convex hyperbolic spaces, Sigma J. Eng. Nat. Sci., 38 (2020), 1031–1050. |
[20] |
E. Khoroshilova, Extragradient-type method for optimal control problem with linear constraints and convex ojective function, Optim. Lett., 7 (2013), 1193–1214. http://dx.doi.org/10.1007/s11590-012-0496-2 doi: 10.1007/s11590-012-0496-2
![]() |
[21] | G. Korpelevich, The extragradient method for finding saddle points and other problems, Matecon, 12 (1976), 747–756. |
[22] |
W. Kumam, H. Rehman, P. Kumam, A new class of computationally efficient algorithms for solving fixed-point problems and variational inequalities in real Hilbert spaces, J. Inequal. Appl., 2023 (2023), 48. http://dx.doi.org/10.1186/s13660-023-02948-8 doi: 10.1186/s13660-023-02948-8
![]() |
[23] |
H. Liu, J. Yang, Weak convergence of iterative methods for solving quasimonotone variational inequalities, Comput. Optim. Appl., 77 (2020), 491–508. http://dx.doi.org/10.1007/s10589-020-00217-8 doi: 10.1007/s10589-020-00217-8
![]() |
[24] |
R. Maluleka, G. Ugwunnadi, M. Aphane, Inertial subgradient extragradient with projection method for solving variational inequality and fixed point problems, AIMS Mathematics, 8 (2023), 30102–30119. http://dx.doi.org/10.3934/math.20231539 doi: 10.3934/math.20231539
![]() |
[25] |
K. Muangchoo, A. Adamu, A. Ibrahim, A. Abubakar, An inertial Halpern-type algorithm involving monotone operators on real Banach spaces with application to image recovery problems, Comp. Appl. Math., 41 (2022), 364. http://dx.doi.org/10.1007/s40314-022-02064-1 doi: 10.1007/s40314-022-02064-1
![]() |
[26] |
A. Ofem, D. Igbokwe, A new faster four step iterative algorithm for Suzuki generalized nonexpansive mappings with an application, Advances in the Theory of Nonlinear Analysis and its Applications, 5 (2021), 482–506. http://dx.doi.org/10.31197/atnaa.869046 doi: 10.31197/atnaa.869046
![]() |
[27] |
A. Ofem, H. Isik, G. Ugwunnadi, R. George, O. Narain, Approximating the solution of a nonlinear delay integral equation by an efficient iterative algorithm in hyperbolic spaces, AIMS Mathematics, 8 (2023), 14919–14950. http://dx.doi.org/10.3934/math.2023762 doi: 10.3934/math.2023762
![]() |
[28] |
A. Ofem, J. Abuchu, R. George, G. Ugwunnadi, O. Narain, Some new results on convergence, weak w2–stability and data dependence of two multivalued almost contractive mappings in hyperbolic spaces, Mathematics, 10 (2022), 3720. http://dx.doi.org/10.3390/math10203720 doi: 10.3390/math10203720
![]() |
[29] |
A. Ofem, U. Udofia, D. Igbokwe, A robust iterative approach for solving nonlinear Volterra delay integro-differential equations, Ural Mathematical Journal, 7 (2021), 59–85. http://dx.doi.org/10.15826/umj.2021.2.005 doi: 10.15826/umj.2021.2.005
![]() |
[30] |
A. Ofem, A. Mebawondu, G. Ugwunnadi, H. Işık, O. Narain, A modified subgradient extragradient algorithm-type for solving quasimonotone variational inequality problems with applications, J. Inequal. Appl., 2023 (2023), 73. http://dx.doi.org/10.1186/s13660-023-02981-7 doi: 10.1186/s13660-023-02981-7
![]() |
[31] | A. Ofem, A. Mebawondu, G. Ugwunnadi, P. Cholamjiak, O. Narain, Relaxed Tseng splitting method with double inertial steps for solving monotone inclusions and fixed point problems, Numer. Algor., in press. http://dx.doi.org/10.1007/s11075-023-01674-y |
[32] |
A. Ofem, A. Mebawondu, C. Agbonkhese, G. Ugwunnadi, O. Narain, Alternated inertial relaxed Tseng method for solving fixed point and quasi-monotone variational inequality problems, Nonlinear Functional Analysis and Applications, 29 (2024), 131–164. http://dx.doi.org/10.22771/nfaa.2024.29.01.10 doi: 10.22771/nfaa.2024.29.01.10
![]() |
[33] |
G. Ogwo, T. Alakoya, O. Mewomo, Iterative algorithm with self-adaptive step size for approximating the common solution of variational inequality and fixed point problems, Optimization, 72 (2023), 677–711. http://dx.doi.org/10.1080/02331934.2021.1981897 doi: 10.1080/02331934.2021.1981897
![]() |
[34] |
G. Okeke, A. Ofem, A novel iterative scheme for solving delay differential equations and nonlinear integral equations in Banach spaces, Math. Method. Appl. Sci., 45 (2022), 5111–5134. http://dx.doi.org/10.1002/mma.8095 doi: 10.1002/mma.8095
![]() |
[35] |
G. Okeke, A. Ofem, T. Abdeljawad, M. Alqudah, A. Khan, A solution of a nonlinear Volterra integral equation with delay via a faster iteration method, AIMS Mathematics, 8 (2023), 102–124. http://dx.doi.org/10.3934/math.2023005 doi: 10.3934/math.2023005
![]() |
[36] |
R. Pant, R. Pandey, Existence and convergence results for a class of non-expansive type mappings in hyperbolic spaces, Appl. Gen. Topol., 20 (2019), 281–295. http://dx.doi.org/10.4995/agt.2019.11057 doi: 10.4995/agt.2019.11057
![]() |
[37] |
B. Polyak, Some methods of speeding up the convergence of iteration methods, USSR Comput. Math. Math. Phys., 4 (1964), 1–17. http://dx.doi.org/10.1016/0041-5553(64)90137-5 doi: 10.1016/0041-5553(64)90137-5
![]() |
[38] | G. Stampacchia, Formes bilinearies coercitives sur les ensembles convexes, C. R. Math. Acad. Sci. Paris, 258 (1964), 4413. |
[39] |
Y. Shehu, P. Vuong, P. Cholamjiak, A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems, J. Fixed Point Theory Appl., 21 (2019), 50. http://dx.doi.org/10.1007/s11784-019-0684-0 doi: 10.1007/s11784-019-0684-0
![]() |
[40] |
Y. Shehu, O. Iyiola, F. Ogbuisi, Iterative method with inertial terms for nonexpansive mappings, Applications to compressed sensing, Numer. Algor., 83 (2020), 1321–1347. http://dx.doi.org/10.1007/s11075-019-00727-5 doi: 10.1007/s11075-019-00727-5
![]() |
[41] |
B. Tan, X. Qin, J. Yao, Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems, J. Glob. Optim., 82 (2022), 523–557. http://dx.doi.org/10.1007/s10898-021-01095-y doi: 10.1007/s10898-021-01095-y
![]() |
[42] |
D. Thong, D. Hieu, Some extragradient-viscosity algorithms for solving variational inequality problems and fixed point problems, Numer. Algor., 82 (2019), 761–789. http://dx.doi.org/10.1007/s11075-018-0626-8 doi: 10.1007/s11075-018-0626-8
![]() |
[43] |
D. Thong, D. Hieu, Inertial subgradient extragradient algorithms with line-search process for solving variational inequality problems and fixed point problems, Numer. Algor., 80 (2019), 1283–1307. http://dx.doi.org/10.1007/s11075-018-0527-x doi: 10.1007/s11075-018-0527-x
![]() |
[44] |
D. Thong, P. Anh, V. Dung, D. Linh, A novel method for finding minimum‑norm solutions to pseudomonotone variational inequalities, Netw. Spat. Econ., 23 (2023), 39–64. http://dx.doi.org/10.1007/s11067-022-09569-6 doi: 10.1007/s11067-022-09569-6
![]() |
[45] |
D. Thong, D. Hieu, T. Rassias, Self adaptive inertial subgradient extragradient algorithms for solving pseudomonotone variational inequality problems, Optim. Lett., 14 (2020), 115–144. http://dx.doi.org/10.1007/s11590-019-01511-z doi: 10.1007/s11590-019-01511-z
![]() |
[46] |
D. Thong, V. Dung, A relaxed inertial factor of the modified subgradient extragradient method for solving pseudo monotone variational inequalities in hilbert spaces, Acta Math. Sci., 43 (2023), 184–204. http://dx.doi.org/10.1007/s10473-023-0112-9 doi: 10.1007/s10473-023-0112-9
![]() |
[47] |
M. Tian, M. Tong, Self-adaptive subgradient extragradient method with inertial modification for solving monotone variational inequality problems and quasinonexpansive fixed point problems, J. Inequal. Appl., 2019 (2019), 7. http://dx.doi.org/10.1186/s13660-019-1958-1 doi: 10.1186/s13660-019-1958-1
![]() |
[48] |
P. Tseng, A modified forward-backward splitting method for maximal monotone mappings, SIAM J. Control Optim., 38 (2000), 431–446. http://dx.doi.org/10.1137/S0363012998338806 doi: 10.1137/S0363012998338806
![]() |
[49] |
P. Vuong, Y. Shehu, Convergence of an extragradient-type method for variational inequality with applications to optimal control problems, Numer. Algor., 81 (2019), 269–291. http://dx.doi.org/10.1007/s11075-018-0547-6 doi: 10.1007/s11075-018-0547-6
![]() |
[50] | Z. Wang, Z. Lei, X. Long, Z. Chen, Tseng splitting method with double inertial steps for solving monotone inclusion problems, arXiv: 2209.11989. |
[51] | Z. Wang, P. Sunthrayuth, A. Adamu, P. Cholamjiak, Modified accelerated Bregman projection methods for solving quasi-monotone variational inequalities, Optimization, in press, http://dx.doi.org/10.1080/02331934.2023.2187663 |
[52] |
H. Xu, Iterative algorithms for nonlinear operators, J. Lond. Math. Soc., 66 (2002), 240–256. http://dx.doi.org/10.1112/S0024610702003332 doi: 10.1112/S0024610702003332
![]() |
[53] |
J. Yang, H. Liu, Strong convergence result for solving monotone variational inequalities in Hilbert space, Numer. Algor., 80 (2019), 741–752. http://dx.doi.org/10.1007/s11075-018-0504-4 doi: 10.1007/s11075-018-0504-4
![]() |
[54] |
J. Yang, H. Liu, A modified projected gradient method for monotone variational inequalities, J. Optim. Theory Appl., 179 (2018), 197–211. http://dx.doi.org/10.1007/s10957-018-1351-0 doi: 10.1007/s10957-018-1351-0
![]() |
[55] |
Y. Yao, O. Iyiola, Y. Shehu, Subgradient extragradient method with double inertial steps for variational inequalities, J. Sci. Comput., 90 (2022), 71. http://dx.doi.org/10.1007/s10915-021-01751-1 doi: 10.1007/s10915-021-01751-1
![]() |
1. | Ahmed Alsaedi, Bashir Ahmad, Afrah Assolami, Sotiris K. Ntouyas, On a nonlinear coupled system of differential equations involving Hilfer fractional derivative and Riemann-Liouville mixed operators with nonlocal integro-multi-point boundary conditions, 2022, 7, 2473-6988, 12718, 10.3934/math.2022704 | |
2. | M. Vellappandi, Venkatesan Govindaraj, José Vanterler da C. Sousa, Fractional optimal reachability problems with ψ ‐Hilfer fractional derivative , 2022, 45, 0170-4214, 6255, 10.1002/mma.8168 | |
3. | Fidel Meléndez-Vázquez, Guillermo Fernández-Anaya, Aldo Jonathan Muñóz-Vázquez, Eduardo Gamaliel Hernández-Martínez, Generalized conformable operators: Application to the design of nonlinear observers, 2021, 6, 2473-6988, 12952, 10.3934/math.2021749 | |
4. | Hamid Lmou, Khalid Hilal, Ahmed Kajouni, Serkan Araci, A New Result for ψ -Hilfer Fractional Pantograph-Type Langevin Equation and Inclusions, 2022, 2022, 2314-4785, 1, 10.1155/2022/2441628 | |
5. | Ravi P. Agarwal, Afrah Assolami, Ahmed Alsaedi, Bashir Ahmad, Existence Results and Ulam–Hyers Stability for a Fully Coupled System of Nonlinear Sequential Hilfer Fractional Differential Equations and Integro-Multistrip-Multipoint Boundary Conditions, 2022, 21, 1575-5460, 10.1007/s12346-022-00650-6 | |
6. | Abdulwasea Alkhazzan, Wadhah Al-Sadi, Varaporn Wattanakejorn, Hasib Khan, Thanin Sitthiwirattham, Sina Etemad, Shahram Rezapour, A new study on the existence and stability to a system of coupled higher-order nonlinear BVP of hybrid FDEs under the p-Laplacian operator, 2022, 7, 2473-6988, 14187, 10.3934/math.2022782 | |
7. | Sina Etemad, Iram Iqbal, Mohammad Esmael Samei, Shahram Rezapour, Jehad Alzabut, Weerawat Sudsutad, Izzet Goksel, Some inequalities on multi-functions for applying in the fractional Caputo–Hadamard jerk inclusion system, 2022, 2022, 1029-242X, 10.1186/s13660-022-02819-8 |
Parameters | Details |
β1 | Susceptible form of recovered individuals |
αm | Newborn mosquitoes transfer rate into Sm |
αh | Newborns ratio to enter in Sh |
γ1 | Transfer ratio of illness from one affected to susceptible people |
ψ | Transfusions rate of average blood with stable time in Ih and Sh |
β2 | Exposed to infected infection rate in people |
ξ | Infected mosquito susceptible bites using fixed time |
γ3 | Rate of Mosquitos infection |
γ2 | Disease transfer through infected (mosquito) to susceptible (individual) |
ηh | People natural rate of death |
δ2 | Exposed recovered population |
δ1 | Susceptible recovered population |
p | Rate of humans heal |
ε | Infected human death due to disease |
ηm | Mosquitos' natural death |
υ | Anti-malarial prescriptions |
e | Bites Sm using the infected humans |
σ | Expires sections using spraying for Sm and Im |
x | Time |
Case | MSE for instances of sampling | Gradient | Performance | Epoch | Time | ||
Test | validation | Train | |||||
I | 2.745×10−07 | 1.697 ×10−07 | 2.366×10−07 | 1.42×10−06 | 2.26×10−07 | 100 | 2 Sec |
II | 1.795×10−07 | 1.432×10−07 | 1.920×10−07 | 8.18×10−07 | 1.91×10−07 | 86 | 2 Sec |
III | 5.112×10−07 | 3.038×10−07 | 3.678×10−07 | 2.94×10−06 | 2.09×10−07 | 69 | 2 Sec |
Parameters | Details |
β1 | Susceptible form of recovered individuals |
αm | Newborn mosquitoes transfer rate into Sm |
αh | Newborns ratio to enter in Sh |
γ1 | Transfer ratio of illness from one affected to susceptible people |
ψ | Transfusions rate of average blood with stable time in Ih and Sh |
β2 | Exposed to infected infection rate in people |
ξ | Infected mosquito susceptible bites using fixed time |
γ3 | Rate of Mosquitos infection |
γ2 | Disease transfer through infected (mosquito) to susceptible (individual) |
ηh | People natural rate of death |
δ2 | Exposed recovered population |
δ1 | Susceptible recovered population |
p | Rate of humans heal |
ε | Infected human death due to disease |
ηm | Mosquitos' natural death |
υ | Anti-malarial prescriptions |
e | Bites Sm using the infected humans |
σ | Expires sections using spraying for Sm and Im |
x | Time |
Case | MSE for instances of sampling | Gradient | Performance | Epoch | Time | ||
Test | validation | Train | |||||
I | 2.745×10−07 | 1.697 ×10−07 | 2.366×10−07 | 1.42×10−06 | 2.26×10−07 | 100 | 2 Sec |
II | 1.795×10−07 | 1.432×10−07 | 1.920×10−07 | 8.18×10−07 | 1.91×10−07 | 86 | 2 Sec |
III | 5.112×10−07 | 3.038×10−07 | 3.678×10−07 | 2.94×10−06 | 2.09×10−07 | 69 | 2 Sec |