Pro Kaelo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Pro Kaelo has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- M. Montaz Ali
School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, South Africa
7 shared publications M. Koorapetse
Department of Mathematics, University of Botswana, Private Bag UB00704, Gaborone, Botswana
5 shared publicationsP. Mtagulwa
Department of Mathematics , Botho University Gaborone , Botswana
3 shared publicationsT. Diphofu
Department of Mathematics, University of Botswana, Private Bag UB00704, Gaborone, Botswana
3 shared publications- Ibrahim Mohammed Sulaiman
College of Applied and Health Sciences, A’Sharqiyah University, Ibra, Oman
2 shared publications Peter Mtagulwa
2 shared publications
Latest Publications
- Open Access
- 15 June 2026
- Published by Springer Nature in Afrika Matematika
- Vol. 37 (3)
Global convergence of a modified CG-based method with Lipschitz continuity for unconstrained optimization and image restoration problems
In this study, we extend the recently proposed RMIL* method to construct a new three-term conjugate gradient (TTCG) direction and show that it possesses sufficient descent property independently of the line search strategy used. We further prove the global convergence of the method using the famous Wolfe line search conditions. The computational efficiency of the algorithm (method) is tested on a set of unconstrained optimization and image restoration problems. The Findings of the numerical experiments show that the proposed method is robust and promising for both unconstrained minimization and application problems.
- 15 June 2026
- Published by Springer Nature in Afrika Matematika
- Vol. 37 (3)
Open AccessGlobal convergence of a modified CG-based method with Lipschitz continuity for unconstrained optimization and image restoration problems
In this study, we extend the recently proposed RMIL* method to construct a new three-term conjugate gradient (TTCG) direction and show that it possesses sufficient descent property independently of the line search strategy used. We further prove the global convergence of the method using the famous Wolfe line search conditions. The computational efficiency of the algorithm (method) is tested on a set of unconstrained optimization and image restoration problems. The Findings of the numerical experiments show that the proposed method is robust and promising for both unconstrained minimization and application problems.
- Open Access
- 25 April 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (4) , e0320416
A spectral Fletcher-Reeves conjugate gradient method with integrated strategy for unconstrained optimization and portfolio selection
The spectral conjugate gradient (SCG) technique is highly efficient in addressing large-scale unconstrained optimization challenges. This paper presents a structured SCG approach that combines the Quasi-Newton direction and an extended conjugacy condition. Drawing inspiration from the Fletcher-Reeves conjugate gradient (CG) parameter, this method is tailored to improve the general structure of the CG approach. We rigorously establish the global convergence of the algorithm for general functions, using criteria from a Wolfe-line search. Numerical experiments performed on some unconstrained optimization problems highlight the superiority of this new algorithm over certain CG methods with similar characteristics. In the context of portfolio selection, the proposed method extended to address the problem of stock allocation, ensuring optimized returns while minimizing risks. Empirical evaluations demonstrate the efficiency of the method, demonstrating significant improvements in computational efficiency and optimization outcomes.
- 25 April 2025
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 20 (4) , e0320416
Open AccessA spectral Fletcher-Reeves conjugate gradient method with integrated strategy for unconstrained optimization and portfolio selection
The spectral conjugate gradient (SCG) technique is highly efficient in addressing large-scale unconstrained optimization challenges. This paper presents a structured SCG approach that combines the Quasi-Newton direction and an extended conjugacy condition. Drawing inspiration from the Fletcher-Reeves conjugate gradient (CG) parameter, this method is tailored to improve the general structure of the CG approach. We rigorously establish the global convergence of the algorithm for general functions, using criteria from a Wolfe-line search. Numerical experiments performed on some unconstrained optimization problems highlight the superiority of this new algorithm over certain CG methods with similar characteristics. In the context of portfolio selection, the proposed method extended to address the problem of stock allocation, ensuring optimized returns while minimizing risks. Empirical evaluations demonstrate the efficiency of the method, demonstrating significant improvements in computational efficiency and optimization outcomes.
- 19 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Descent Three-Term Conjugate Gradient Direction for Problems of Unconstrained Optimization with Application
This study introduces an improved three-term conjugate gradient (CG) algorithm which fulfills the descent conditions and exhibits good global convergence properties. The development of this new algorithm is based on the findings of recently introduced generalized RMIL CG technique. The algorithm has been modified so that the search direction would always meet the sufficient descent condition no matter the line-search techniques employed. Under some given assumptions, the algorithm’s global convergence result for the general nonconvex functions is established. The numerical efficacy of the suggested three-term CG algorithm is assessed through comparisons with four other CG algorithms. The assessment is performed using an array of unconstrained optimization benchmark functions. The acquired findings indicate that all the considered algorithms exhibit similar performance, particularly the variants of the RMIL method. One algorithm is more robust and slightly faster than the rest. However, it is essential to highlight that the newly developed CG formula outperforms all the other algorithms, including a recently presented three-term PRP algorithm. The study further expanded the proposed method to address an image restoration problem. The computational experiments yielded promising results, proving that the proposed CG algorithm surpasses others. It produces higher-quality output images, requires less CPU time (sec), and achieves higher PSNR values.
- 19 March 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Computational Methods
- Vol. 22 (07)
A Descent Three-Term Conjugate Gradient Direction for Problems of Unconstrained Optimization with Application
This study introduces an improved three-term conjugate gradient (CG) algorithm which fulfills the descent conditions and exhibits good global convergence properties. The development of this new algorithm is based on the findings of recently introduced generalized RMIL CG technique. The algorithm has been modified so that the search direction would always meet the sufficient descent condition no matter the line-search techniques employed. Under some given assumptions, the algorithm’s global convergence result for the general nonconvex functions is established. The numerical efficacy of the suggested three-term CG algorithm is assessed through comparisons with four other CG algorithms. The assessment is performed using an array of unconstrained optimization benchmark functions. The acquired findings indicate that all the considered algorithms exhibit similar performance, particularly the variants of the RMIL method. One algorithm is more robust and slightly faster than the rest. However, it is essential to highlight that the newly developed CG formula outperforms all the other algorithms, including a recently presented three-term PRP algorithm. The study further expanded the proposed method to address an image restoration problem. The computational experiments yielded promising results, proving that the proposed CG algorithm surpasses others. It produces higher-quality output images, requires less CPU time (sec), and achieves higher PSNR values.
- Open Access
- 5 July 2024
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 47 (12) , 2375-2397
A convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- 5 July 2024
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 47 (12) , 2375-2397
Open AccessA convex combination of improved Fletcher-Reeves and Rivaie-Mustafa-Ismail-Leong conjugate gradient methods for unconstrained optimization problems and applications
- Open Access
- 1 May 2024
- Published by Walter de Gruyter GmbH in Journal of Applied Mathematics, Statistics and Informatics
- Vol. 20 (1) , 33-52
Application of a globally convergent hybrid conjugate gradient method in portfolio optimization
In this paper, we propose a modification that improves efficiency, robustness and reliability of the famous HS conjugate gradient method. In particular, we propose a hybrid of the HS and DHS methods, where DHS is another recent modification of the HS method. Irrespective of the line search, the search direction of the proposed method is sufficiently descent. Moreover, the new approach guarantees global convergence for general functions under the strong Wolfe line search. Numerical results and performance profiles are reported, and indicate that the new approach outperforms three similar methods in the literature. We also give a practical application of the new approach in minimizing risk in portfolio selection.
- 1 May 2024
- Published by Walter de Gruyter GmbH in Journal of Applied Mathematics, Statistics and Informatics
- Vol. 20 (1) , 33-52
Open AccessApplication of a globally convergent hybrid conjugate gradient method in portfolio optimization
In this paper, we propose a modification that improves efficiency, robustness and reliability of the famous HS conjugate gradient method. In particular, we propose a hybrid of the HS and DHS methods, where DHS is another recent modification of the HS method. Irrespective of the line search, the search direction of the proposed method is sufficiently descent. Moreover, the new approach guarantees global convergence for general functions under the strong Wolfe line search. Numerical results and performance profiles are reported, and indicate that the new approach outperforms three similar methods in the literature. We also give a practical application of the new approach in minimizing risk in portfolio selection.
- Open Access
- 1 January 2022
- Published by Walter de Gruyter GmbH in Topological Algebra and its Applications
- Vol. 10 (1) , 47-60
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements. In this paper, we present a hybrid three-term conjugate gradient method with a direction that always satisfies the sufficient descent condition. We establish global convergence of the new method under the weak Wolfe line search conditions. We also report some numerical results of the proposed method compared to relevant methods in the literature.
- 1 January 2022
- Published by Walter de Gruyter GmbH in Topological Algebra and its Applications
- Vol. 10 (1) , 47-60
Open AccessA convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
Conjugate gradient methods are very popular for solving large scale unconstrained optimization problems because of their simplicity to implement and low memory requirements. In this paper, we present a hybrid three-term conjugate gradient method with a direction that always satisfies the sufficient descent condition. We establish global convergence of the new method under the weak Wolfe line search conditions. We also report some numerical results of the proposed method compared to relevant methods in the literature.
- 7 September 2021
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 18 (5) , 1-20
Another Three-Term Conjugate Gradient Method Close to the Memoryless BFGS for Large-Scale Unconstrained Optimization Problems
- 7 September 2021
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 18 (5) , 1-20
Another Three-Term Conjugate Gradient Method Close to the Memoryless BFGS for Large-Scale Unconstrained Optimization Problems
- 5 August 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (6) , 4335-4356
A Globally Convergent Derivative-Free Projection Method for Nonlinear Monotone Equations with Applications
- 5 August 2021
- Published by Springer Nature in Bulletin of the Malaysian Mathematical Sciences Society
- Vol. 44 (6) , 4335-4356
A Globally Convergent Derivative-Free Projection Method for Nonlinear Monotone Equations with Applications
- 1 June 2021
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 11 (2) , 421-434
An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems
The East Asian Journal on Applied Mathematics (EAJAM) aims at promoting study and research in Applied Mathematics in East Asia. It is the editorial policy of EAJAM to accept refereed papers in all active areas of Applied Mathematics and related Mathematical Sciences. Novel applications of Mathematics in real situations are especially welcome. Substantial survey papers on topics of exceptional interest will also be published occasionally.
- 1 June 2021
- Published by Global Science Press in East Asian Journal on Applied Mathematics
- Vol. 11 (2) , 421-434
An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems
The East Asian Journal on Applied Mathematics (EAJAM) aims at promoting study and research in Applied Mathematics in East Asia. It is the editorial policy of EAJAM to accept refereed papers in all active areas of Applied Mathematics and related Mathematical Sciences. Novel applications of Mathematics in real situations are especially welcome. Substantial survey papers on topics of exceptional interest will also be published occasionally.
- 9 June 2020
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 98 (4) , 719-737
A globally convergent projection method for a system of nonlinear monotone equations
In this paper, a new conjugate gradient-based projection method for solving a system of nonlinear monotone equations is proposed. The method can be viewed as an extension of a family of conjugate gradient methods for unconstrained optimization by Li et al. [16]. The proposed method is derivative-free which makes it suitable for large-scale nonlinear monotone equations. We show that the method satisfies the descent condition independent of line searches and that the method is globally convergent. Numerical results indicate that the proposed method is efficient.
- 9 June 2020
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 98 (4) , 719-737
A globally convergent projection method for a system of nonlinear monotone equations
In this paper, a new conjugate gradient-based projection method for solving a system of nonlinear monotone equations is proposed. The method can be viewed as an extension of a family of conjugate gradient methods for unconstrained optimization by Li et al. [16]. The proposed method is derivative-free which makes it suitable for large-scale nonlinear monotone equations. We show that the method satisfies the descent condition independent of line searches and that the method is globally convergent. Numerical results indicate that the proposed method is efficient.