Nasiru Salihu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nasiru Salihu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Poom Kumam
Center of Excellence in Theoretical and Computational Science (TaCS-CoE) and KMUTT Fixed Point Research Laboratory, Room SCL 802, Fixed Point Laboratory, Science Laboratory Building, Department of Mathematics, Faculty of Science, King Mongkut’s University of Technology Thonburi, Bangkok, Thailand
7 shared publications - Thidaporn Seangwattana
Faculty of Science Energy and Environment, King Mongkut’s University of Technology North Bangkok, Rayong Campus (KMUTNB), Rayong, Thailand
3 shared publications - Ibrahim Mohammed Sulaiman
College of Applied and Health Sciences, A’Sharqiyah University, Ibra, Oman
2 shared publications Aliyu Muhammed Awwal
Center of Excellence in Theoretical and Computational Science, Fixed Point Research Laboratory, Fixed Point Theory and Applications Research Group, Faculty of Science, King Mongkut's University of Technology Thonburi, Bangkok, Thailand
1 shared publication- Aliyu Muhammed Awwal
Department of Mathematics , Faculty of Science , Gombe State University , Gombe 760253 , Nigeria , gsu.edu.ng
1 shared publication - Huzaifa Aliyu Babando
Department of Mathematics, Faculty of Sciences, Modibbo Adama University of Technology, Yola, Nigeria
1 shared publication
Latest Publications
- Open Access
- 17 September 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
Dai–Liao-type Riemannian optimization for solving the Gough–Stewart platform
- 17 September 2026
- Published by Elsevier in EURO Journal on Computational Optimization
- Vol. 14
Open AccessDai–Liao-type Riemannian optimization for solving the Gough–Stewart platform
- Open Access
- 1 March 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (2) , 1269-1286
Some three-term RMIL conjugate gradient methods with descent property for solving optimization problems with application
To propose a conjugate gradient (CG) scheme with a promising structure, it has been observed that Newton's direction is optimal when the current iteration is near the solution, and the objective function behaves like a quadratic. However, for large-scale problems, a method that does not require second-derivative information is often necessary. Therefore, to develop a more effective scheme for handling complex problems, we apply the standard secant equation to construct a combination of three-term CG search directions using the β k RMIL method. This combination approximates the quasi-Newton direction and ensures sufficient descent. Furthermore, we establish the global convergence of the scheme under mild assumptions, demonstrating that the algorithm is robust and reliable compared to earlier CG methods. Finally, we showcase the efficiency of the proposed scheme by applying it to solve a three degrees of freedom (3DOF) motion control model.
- 1 March 2026
- Published by EDP Sciences in RAIRO - Operations Research
- Vol. 60 (2) , 1269-1286
Open AccessSome three-term RMIL conjugate gradient methods with descent property for solving optimization problems with application
To propose a conjugate gradient (CG) scheme with a promising structure, it has been observed that Newton's direction is optimal when the current iteration is near the solution, and the objective function behaves like a quadratic. However, for large-scale problems, a method that does not require second-derivative information is often necessary. Therefore, to develop a more effective scheme for handling complex problems, we apply the standard secant equation to construct a combination of three-term CG search directions using the β k RMIL method. This combination approximates the quasi-Newton direction and ensures sufficient descent. Furthermore, we establish the global convergence of the scheme under mild assumptions, demonstrating that the algorithm is robust and reliable compared to earlier CG methods. Finally, we showcase the efficiency of the proposed scheme by applying it to solve a three degrees of freedom (3DOF) motion control model.
- 9 June 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (2) , 547-584
An improved Dai–Kou conjugate gradient method with spectral search direction and applications
- 9 June 2025
- Published by Taylor & Francis in Engineering Optimization
- Vol. 58 (2) , 547-584
An improved Dai–Kou conjugate gradient method with spectral search direction and applications
- Open Access
- 17 March 2025
- Published by Elsevier in Franklin Open
- Vol. 10
Some hybrid Riemannian conjugate gradient methods with restart strategy
- 17 March 2025
- Published by Elsevier in Franklin Open
- Vol. 10
Open AccessSome hybrid Riemannian conjugate gradient methods with restart strategy
- 18 June 2024
- Published by Emerald Publishing in Engineering Computations
- Vol. 41 (5) , 1203-1232
A sufficient descent hybrid conjugate gradient method without line search consideration and application
Purpose: Previous RMIL versions of the conjugate gradient method proposed in literature exhibit sufficient descent with Wolfe line search conditions, yet their global convergence depends on certain restrictions. To alleviate these assumptions, a hybrid conjugate gradient method is proposed based on the conjugacy condition.Design/methodology/approach: The conjugate gradient (CG) method strategically alternates between RMIL and KMD CG methods by using a convex combination of the two schemes, mitigating their respective weaknesses. The theoretical analysis of the hybrid method, conducted without line search consideration, demonstrates its sufficient descent property. This theoretical understanding of sufficient descent enables the removal of restrictions previously imposed on versions of the RMIL CG method for global convergence result.Findings: Numerical experiments conducted using a hybrid strategy that combines the RMIL and KMD CG methods demonstrate superior performance compared to each method used individually and even outperform some recent versions of the RMIL method. Furthermore, when applied to solve an image reconstruction model, the method exhibits reliable results.Originality/value: The strategy used to demonstrate the sufficient descent property and convergence result of RMIL CG without line search consideration through hybrid techniques has not been previously explored in literature. Additionally, the two CG schemes involved in the combination exhibit similar sufficient descent structures based on the assumption regarding the norm of the search direction.
- 18 June 2024
- Published by Emerald Publishing in Engineering Computations
- Vol. 41 (5) , 1203-1232
A sufficient descent hybrid conjugate gradient method without line search consideration and application
Purpose: Previous RMIL versions of the conjugate gradient method proposed in literature exhibit sufficient descent with Wolfe line search conditions, yet their global convergence depends on certain restrictions. To alleviate these assumptions, a hybrid conjugate gradient method is proposed based on the conjugacy condition.Design/methodology/approach: The conjugate gradient (CG) method strategically alternates between RMIL and KMD CG methods by using a convex combination of the two schemes, mitigating their respective weaknesses. The theoretical analysis of the hybrid method, conducted without line search consideration, demonstrates its sufficient descent property. This theoretical understanding of sufficient descent enables the removal of restrictions previously imposed on versions of the RMIL CG method for global convergence result.Findings: Numerical experiments conducted using a hybrid strategy that combines the RMIL and KMD CG methods demonstrate superior performance compared to each method used individually and even outperform some recent versions of the RMIL method. Furthermore, when applied to solve an image reconstruction model, the method exhibits reliable results.Originality/value: The strategy used to demonstrate the sufficient descent property and convergence result of RMIL CG without line search consideration through hybrid techniques has not been previously explored in literature. Additionally, the two CG schemes involved in the combination exhibit similar sufficient descent structures based on the assumption regarding the norm of the search direction.
- Open Access
- 16 March 2023
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 18 (3) , e0281250
The global convergence of spectral RMIL conjugate gradient method for unconstrained optimization with applications to robotic model and image recovery
In 2012, Rivaie et al. introduced RMIL conjugate gradient (CG) method which is globally convergent under the exact line search. Later, Dai (2016) pointed out abnormality in the convergence result and thus, imposed certain restricted RMIL CG parameter as a remedy. In this paper, we suggest an efficient RMIL spectral CG method. The remarkable feature of this method is that, the convergence result is free from additional condition usually imposed on RMIL. Subsequently, the search direction is sufficiently descent independent of any line search technique. Thus, numerical experiments on some set of benchmark problems indicate that the method is promising and efficient. Furthermore, the efficiency of the proposed method is demonstrated on applications arising from arm robotic model and image restoration problems.
- 16 March 2023
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 18 (3) , e0281250
Open AccessThe global convergence of spectral RMIL conjugate gradient method for unconstrained optimization with applications to robotic model and image recovery
In 2012, Rivaie et al. introduced RMIL conjugate gradient (CG) method which is globally convergent under the exact line search. Later, Dai (2016) pointed out abnormality in the convergence result and thus, imposed certain restricted RMIL CG parameter as a remedy. In this paper, we suggest an efficient RMIL spectral CG method. The remarkable feature of this method is that, the convergence result is free from additional condition usually imposed on RMIL. Subsequently, the search direction is sufficiently descent independent of any line search technique. Thus, numerical experiments on some set of benchmark problems indicate that the method is promising and efficient. Furthermore, the efficiency of the proposed method is demonstrated on applications arising from arm robotic model and image restoration problems.