Ahmed Alridha
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
Ahmed Alridha has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Abbas Musleh Salman
Ministry of Education, General Directorate of Education in Babylon, Babylon, Iraq
3 shared publications - Ahmed Sabah Al-Jilawi
Department of Mathematics -University of Babylon
2 shared publications - Ahmed Hadi Hussain
Department of Mathematics, College of Education for Pure Sciences, University of Babylon, Hilla 51002, Iraq
1 shared publication Ahmed Sabah Al-Jilawi
College of Education for Pure Sciences, University of Babylon, Iraq
1 shared publicationFadhil Abdalhasan Wahbi
Department of Mathematics Science, Ministry of Education, Babylon, Iraq
1 shared publicationMazin Kareem Kadhim
Department of Mathematics Science, Ministry of Education, Babylon, Iraq
1 shared publication
Latest Publications
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3097 (1) , 080025
Exploring optimization algorithms for challenging multidimensional optimization problems: A comparative approach
This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually, This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually,
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3097 (1) , 080025
Exploring optimization algorithms for challenging multidimensional optimization problems: A comparative approach
This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually, This paper investigates the Nelder-Mead, Powell, and Differential Evolution algorithms in the optimization of a multidimensional optimization problem. Actually,
- Open Access
- 31 October 2023
- Published by Institut Teknologi Sumatra in Indonesian Journal of Applied Mathematics
- Vol. 3 (2) , 8-14
Efficiency and Accuracy in Quadratic Curve Fitting: A Comparative Analysis of Optimization Techniques
In this paper, we investigate an optimization methods might be applied for solving curve fitting by making use of a quadratic model. To discover the ideal parameters for the quadratic model, synthetic experimental data is generated, and then two unique optimization approaches, namely differential evolution and the Nelder-Mead algorithm, are applied to the problem in order to find the optimal values for those parameters. The mean squared error as well as the correlation coefficient are both metrics that are incorporated into the objective function. When the results of these algorithms are compared, trade-offs between the rate of convergence and the quality of the fit are revealed. This work sheds light on the necessity of selecting proper optimization algorithms for specific circumstances and provides insights into the balance that must be struck between accurate curve fitting and efficient use of computational resources in the process of curve fitting.
- 31 October 2023
- Published by Institut Teknologi Sumatra in Indonesian Journal of Applied Mathematics
- Vol. 3 (2) , 8-14
Open AccessEfficiency and Accuracy in Quadratic Curve Fitting: A Comparative Analysis of Optimization Techniques
In this paper, we investigate an optimization methods might be applied for solving curve fitting by making use of a quadratic model. To discover the ideal parameters for the quadratic model, synthetic experimental data is generated, and then two unique optimization approaches, namely differential evolution and the Nelder-Mead algorithm, are applied to the problem in order to find the optimal values for those parameters. The mean squared error as well as the correlation coefficient are both metrics that are incorporated into the objective function. When the results of these algorithms are compared, trade-offs between the rate of convergence and the quality of the fit are revealed. This work sheds light on the necessity of selecting proper optimization algorithms for specific circumstances and provides insights into the balance that must be struck between accurate curve fitting and efficient use of computational resources in the process of curve fitting.
- Open Access
- 1 April 2022
- Published by Universidad Tecnica de Manabi in International journal of health sciences
- p. 523-536
Solving NP-hard problem using a new relaxation of approximate methods
A new approach has been introduced for solving NP-hardness problem in combinatorial optimization problems. Actully, our study focused on the relationship between the Lagrange method and Penalty method ,this paper introduce a new relaxation of the fesible region.Furthermore, NP hard problem has been tested and showed that the Augmented Lagrangian Approach outperformed the Penalty method. Finally, our study focuses on enhancing the theoretical convergence features as well as numerical computing.
- 1 April 2022
- Published by Universidad Tecnica de Manabi in International journal of health sciences
- p. 523-536
Open AccessSolving NP-hard problem using a new relaxation of approximate methods
A new approach has been introduced for solving NP-hardness problem in combinatorial optimization problems. Actully, our study focused on the relationship between the Lagrange method and Penalty method ,this paper introduce a new relaxation of the fesible region.Furthermore, NP hard problem has been tested and showed that the Augmented Lagrangian Approach outperformed the Penalty method. Finally, our study focuses on enhancing the theoretical convergence features as well as numerical computing.
- 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) , 012171
Some Topics on Convex Optimization
The aim of this paper is to clarify several important points, including a brief and adequate explanation of loving improvement, as well as laying out a number of important mathematical formulas that we need, supported with graphs.
- 1 March 2021
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1818 (1) , 012171
Open AccessSome Topics on Convex Optimization
The aim of this paper is to clarify several important points, including a brief and adequate explanation of loving improvement, as well as laying out a number of important mathematical formulas that we need, supported with graphs.
- 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.
- Open Access
- 1 January 2021
- Vol. 12 (2) , 1453-1461
Training analysis of optimization models in machine learning
- 1 January 2021
- Vol. 12 (2) , 1453-1461
Open AccessTraining analysis of optimization models in machine learning