Ahmed Sabah Al-Jilawi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ahmed Sabah Al-Jilawi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Ahmed Alridha
Ministry of Education, General Directorate of Education in Babylon
2 shared publications Nofl Sh. Al-Shimari
College of Education for Pure S.C/University of Babylon
2 shared publications- Abbas Musleh Salman
Ministry of Education, General Directorate of Education in Babylon, Babylon, Iraq
1 shared publication Ahmed Ahmed
1 shared publicationAmeer Al-Zamili
Babylon Univ, Coll Pure Sci, Dept Math, Fac Educ, Babylon, Iraq
1 shared publicationBasim Rabaa Jumaa
College of Education for Pure S.C/University of Babylon
1 shared publication
Latest Publications
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in International Journal of Neutrosophic Science
- Vol. 25 (3) , 115-122
Modern Free-Derivative Numerical Optimization of Approximate Algorithms Convergence and Neutrosophic Convergence
The aim of this study is to compare common and previously used numerical algorithms for nonlinear problems under different conditions. This study proposes a parallel implementation of two free derivative optimization methods, Powell's method and Nelder-Mead's method, combined with two restart strategies to achieve a global search. In terms of total time, the Powell method converges faster than the Nelder-Mead method. The final function value obtained by the Powell method is slightly lower. Both are optimization techniques used to find the minimum of an objective function in multidimensional space, without requiring derivatives. Also, we extend our results to apply to some neutrosophic non-linear problems under different neutrosophic-based conditions with many examples that explain the validity of our approach.
- 1 January 2025
- Published by American Scientific Publishing Group (ASPG) LLC in International Journal of Neutrosophic Science
- Vol. 25 (3) , 115-122
Modern Free-Derivative Numerical Optimization of Approximate Algorithms Convergence and Neutrosophic Convergence
The aim of this study is to compare common and previously used numerical algorithms for nonlinear problems under different conditions. This study proposes a parallel implementation of two free derivative optimization methods, Powell's method and Nelder-Mead's method, combined with two restart strategies to achieve a global search. In terms of total time, the Powell method converges faster than the Nelder-Mead method. The final function value obtained by the Powell method is slightly lower. Both are optimization techniques used to find the minimum of an objective function in multidimensional space, without requiring derivatives. Also, we extend our results to apply to some neutrosophic non-linear problems under different neutrosophic-based conditions with many examples that explain the validity of our approach.
- 1 January 2025
- Published by International Journal of Mathematics and Computer Science in International Journal of Mathematics and Computer Science
- Vol. 20 (1) , 365-371
A New Hybrid Heuristic Algorithm of Mathematical Numerical Optimization Based on Population Methods
The purpose of this study is to compare population methods. We present the genetic algorithms and particle swarm algorithm of nonlinear optimization which include two classes of heuristic algorithms for solving n-dimensional mathematical optimization problems. This work suggests a new hybrid algorithm which is nests particle swarm optimization (PSA) operations in the genetic algorithm (GA). The new hybrid algorithm provides a better convergence between the exploitation compared and exploration of both parent algorithms. However, the existing hybrid algorithms and achieving consistency provide the best accurate results of the optimal solution with relatively small computational cost.
- 1 January 2025
- Published by International Journal of Mathematics and Computer Science in International Journal of Mathematics and Computer Science
- Vol. 20 (1) , 365-371
A New Hybrid Heuristic Algorithm of Mathematical Numerical Optimization Based on Population Methods
The purpose of this study is to compare population methods. We present the genetic algorithms and particle swarm algorithm of nonlinear optimization which include two classes of heuristic algorithms for solving n-dimensional mathematical optimization problems. This work suggests a new hybrid algorithm which is nests particle swarm optimization (PSA) operations in the genetic algorithm (GA). The new hybrid algorithm provides a better convergence between the exploitation compared and exploration of both parent algorithms. However, the existing hybrid algorithms and achieving consistency provide the best accurate results of the optimal solution with relatively small computational cost.
- 1 January 2024
- Published by International Journal of Mathematics and Computer Science in International Journal of Mathematics and Computer Science
- Vol. 20 (1) , 9-15
Optimizing Logistic Regression with Enhanced Convergence: A Modified ADMM Approach
In this study, we present a revised version of the Alternating Direction Method of Multipliers (ADMM) algorithm, specifically developed to enhance the convergence and stability of logistic regression models. Our updated technique achieves substantial enhancements in classification accuracy and model interpretability by integrating supplementary regularization and stability components into the ADMM update equations. The experimental findings on synthetic datasets demonstrate that our improved ADMM algorithm surpasses the conventional ADMM, offering a resilient and efficient solution for logistic regression. In this paper, we emphasize the potential of our adjustments to be a valuable improvement in optimizing logistic regression algorithms.
- 1 January 2024
- Published by International Journal of Mathematics and Computer Science in International Journal of Mathematics and Computer Science
- Vol. 20 (1) , 9-15
Optimizing Logistic Regression with Enhanced Convergence: A Modified ADMM Approach
In this study, we present a revised version of the Alternating Direction Method of Multipliers (ADMM) algorithm, specifically developed to enhance the convergence and stability of logistic regression models. Our updated technique achieves substantial enhancements in classification accuracy and model interpretability by integrating supplementary regularization and stability components into the ADMM update equations. The experimental findings on synthetic datasets demonstrate that our improved ADMM algorithm surpasses the conventional ADMM, offering a resilient and efficient solution for logistic regression. In this paper, we emphasize the potential of our adjustments to be a valuable improvement in optimizing logistic regression algorithms.
- Open Access
- 30 December 2023
- Published by Wasit University in Wasit Journal for Pure sciences
- Vol. 2 (4) , 1-11
A Numerical Technique for Solving Optimization Problems
The aim of this paper is to calculate a better approximation value (whether it is maximize or minimize ) for one- and two-dimensional nonlinear equations using the best numerical optimization algorithms, which is Newton's method. The idea of this technique is based on approximating the function by expanding the Taylor series expansion and iteratively updating the estimate of the optimal solution. we have obtained good results in terms of accuracy and speed of approach, as shown in the examples mentioned. We also mentioned the applications of Newton’s method in multiple disciplines, including engineering, physics, economics, finance, computer graphics, machine learning, image processing, and other applications.
- 30 December 2023
- Published by Wasit University in Wasit Journal for Pure sciences
- Vol. 2 (4) , 1-11
Open AccessA Numerical Technique for Solving Optimization Problems
The aim of this paper is to calculate a better approximation value (whether it is maximize or minimize ) for one- and two-dimensional nonlinear equations using the best numerical optimization algorithms, which is Newton's method. The idea of this technique is based on approximating the function by expanding the Taylor series expansion and iteratively updating the estimate of the optimal solution. we have obtained good results in terms of accuracy and speed of approach, as shown in the examples mentioned. We also mentioned the applications of Newton’s method in multiple disciplines, including engineering, physics, economics, finance, computer graphics, machine learning, image processing, and other applications.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012137
Mathematical Programming Computational for Solving NP-Hardness Problem
In this paper we will introduce a new approach for solving K-cluster problem which is one of the NP-hardness problem, in combinatorial optimization problems. In addition, P is NP-hardness if and only if the polynomial time of each NP problem is reduced to P. Actually, our study was focused on the two methods which is Penalty and Augmented Lagrangian methods base on the numerical result. Moreover, we tested the K-cluster problem and found the Augmented Lagrangian Method faster than Penalty method. Finally, our research is not just focus on the numerical computational but also improving the theoretical converges properties.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012137
Open AccessMathematical Programming Computational for Solving NP-Hardness Problem
In this paper we will introduce a new approach for solving K-cluster problem which is one of the NP-hardness problem, in combinatorial optimization problems. In addition, P is NP-hardness if and only if the polynomial time of each NP problem is reduced to P. Actually, our study was focused on the two methods which is Penalty and Augmented Lagrangian methods base on the numerical result. Moreover, we tested the K-cluster problem and found the Augmented Lagrangian Method faster than Penalty method. Finally, our research is not just focus on the numerical computational but also improving the theoretical converges properties.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012135
On the Bridge Between Computational Results Of New Line Search Technique
The goal of this paper is to find a better linesearch technique and different combinations of optimization and linesearch algorithms. Line searchtechnique on the off chance that it looks for the base of a descent direction vector that, when processed iteratively with a sensible advance size.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012135
Open AccessOn the Bridge Between Computational Results Of New Line Search Technique
The goal of this paper is to find a better linesearch technique and different combinations of optimization and linesearch algorithms. Line searchtechnique on the off chance that it looks for the base of a descent direction vector that, when processed iteratively with a sensible advance size.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012181
Mathematical Optimization Techniques in Computational of Biological Models
The aim of this research is focused on the mathematical optimization in computational systems biological models based on find the good method that gives converges faster. Our strategy is to use Bundle Method instead of using Subgradient Methods. Also, we improve the convergence of theoretical properties of the methods. The basic idea of approximation is the subdifferential of the objective function by using subgradients from previous iterations of a bundle method.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012181
Open AccessMathematical Optimization Techniques in Computational of Biological Models
The aim of this research is focused on the mathematical optimization in computational systems biological models based on find the good method that gives converges faster. Our strategy is to use Bundle Method instead of using Subgradient Methods. Also, we improve the convergence of theoretical properties of the methods. The basic idea of approximation is the subdifferential of the objective function by using subgradients from previous iterations of a bundle method.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012140
Improving Theoretical Line Search Techniques of Practical Numerical Optimization
The paper aims to shed light on some important concepts in optimization so that the reader can have a broad knowledge and awareness of idealism, In addition to that we bring the reader closer to know the line of research and how to employ to solve various problems of optimization.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012140
Open AccessImproving Theoretical Line Search Techniques of Practical Numerical Optimization
The paper aims to shed light on some important concepts in optimization so that the reader can have a broad knowledge and awareness of idealism, In addition to that we bring the reader closer to know the line of research and how to employ to solve various problems of optimization.
- Open Access
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012179
The Applications of NP-hardness optimizations problem
In this paper we present a study on the problem of NP hardness and their applications in computer science. In addition, our study sheds light on the most important applications present in our daily life and how the problem of NP stiffness is an important primary focus in it. Moreover, the aim was to search for further modifications in order to obtain optimal methods for their adoption. Finally, the aim of this study is to seek to solve the decision problem of NP hardness to achieve the desired goals with the optimal result.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012179
Open AccessThe Applications of NP-hardness optimizations problem
In this paper we present a study on the problem of NP hardness and their applications in computer science. In addition, our study sheds light on the most important applications present in our daily life and how the problem of NP stiffness is an important primary focus in it. Moreover, the aim was to search for further modifications in order to obtain optimal methods for their adoption. Finally, the aim of this study is to seek to solve the decision problem of NP hardness to achieve the desired goals with the optimal result.