Francis Onyineychi Nwawuru

Dr. Francis Onyineychi Nwawuru

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2023 in Computational and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
JEJeremiah N. Ezeora
Jeremiah N. Ezeora
Cyril EnyiCyril Enyi
Cyril Enyi
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
RORichard C. Ogbonna
Richard C. Ogbonna

21 April 2025 in Fixed Point Theory and Algorithms for Sciences and Engineering
Verified
Journal Article
Open access
PDF file
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
ONOjen K. Narain
Ojen K. Narain
MDMohammad Dilshad
Mohammad Dilshad
JEJeremiah N. Ezeora
Jeremiah N. Ezeora
In this article, two-step inertial method is proposed for finding zero point of the sum of two monotone operators and fixed-point of κ-strictly pseudo-nonspreading mapping in a real Hilbert space. Weak convergence of the sequence of the proposed method is obtained under less restrictive conditions. With suitable numerical examples, the method is shown to be robust in terms of speed of convergence. It is also shown to be an improvement over one-step inertial method, which has been used by many authors in the literature to solve similar problems.

13 December 2023 in Rendiconti del Circolo Matematico di Palermo Series 2
Verified
Journal Article
Closed access
PDF file
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
GEGrace N. Echezona
Grace N. Echezona
COChibueze Okeke
Chibueze Okeke

8 February 2023 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
JEJeremiah N. Ezeora
Jeremiah N. Ezeora
In this paper, we introduce a simple and easily computable algorithm for finding a common solution to split-equilibrium problems and fixed-point problems in the framework of real Hilbert spaces. New self-adaptive step sizes are adopted for the avoidance of Lipschitz constants that are not practically implemented. Furthermore, an inertial term is incorporated to speed up the rate of convergence, a condition that is very desirable in applications. A strong convergence is obtained under some mild assumptions, which is not limited to the fact that the bifunctions are pseudomonotone operators. This condition is better, weaker, and more general than being strongly pseudomonotone or monotone. Our result improves and extends already announced results in this direction of research.

9 January 2023 in Pan-American Journal of Mathematics
Verified
Journal Article
Open access
PDF file
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
Many researchers have incorporated an inertial term and will continue to involve it in iterative algorithms due to the fact that it speeds up the rate of convergence which is desirable in applications. In this paper, we propose a new inertial extrapolation algorithm for solving split monotone variational inclusion problems which turns out to solve fixed point problems in the framework of real Hilbert spaces. Our proposed algorithm which is the generalization of split feasibility problems among many others, does not involve the knowledge of operator norm which is sometimes difficult in practice. Furthermore, we prove under some mild assumptions that the sequence generated recursively by our algorithm converges strongly to a common solution of split monotone variational inclusion problems and fixed point of κ-demicontractive mapping. Finally, we apply our algorithm to solve other related problems, precisely linear inverse problems. Some numerical illustrations are provided to further demonstrate the efficiency and competitiveness of our algorithm.

11 December 2025 in Axioms
Verified
Journal Article
Open access
PDF file
Mohammad DilshadMohammad Dilshad
Mohammad Dilshad
IAIbrahim Al-Dayel
Ibrahim Al-Dayel
FNFrancis Onyineychi Nwawuru
Francis Onyineychi Nwawuru
JEJeremiah N. Ezeora
Jeremiah N. Ezeora
This paper studies an efficient method for solving stochastic optimization problems formulated as stochastic variational inequalities with a quasi-monotone operator, where the cost function extends the classical monotone and pseudomonotone operators. Our proposed method iterates an adaptive stepsize that adjusts automatically without linesearch and includes a momentum term to accelerate the convergence. Each iteration requires only a single projection onto the feasible set, ensuring low computational complexity. Under standard assumptions, the algorithm achieves almost sure convergence and a proven convergence rate. Furthermore, numerical experiments demonstrate its superior performance, accuracy, stability, and efficiency compared with existing stochastic approximation schemes. We also apply the method to problems such as stochastic network bandwidth allocation, stochastic complementarity problems, and the networked stochastic Nash–Cournot game, showing its strength and practical usefulness. The obtained result is an extension of existing works in the literature.