2025, Vol. 6, Issue 1, Part D
A review on various techniques of numerical optimization
Author(s): Mobin Ahmad
Abstract: There is a foundational description of optimization approaches. The basic model of the non-linear, restricted optimization problem is introduced and various approaches are discussed for solving the resulting problem of optimization. The techniques are graded as either local algorithms (typical gradients), or global algorithms (typically non gradients or evolutionary ones). There are other optimization methods, and the limited space available here can not be thoroughly investigated. Instead, attempts are made to focus on methods widely used in applications for engineering optimization. This analysis is usually carried out without any specific criteria such as linear programming, convex problems, multi-target optimization, multidisciplinary optimization, etc. Different strategies illustrate the advantages and drawbacks and are recommended to assist the designer in choosing the technique to deal with a particular problem. A brief description of a common approach to help explain this specific class of algorithms will be presented where possible.
DOI: https://doi.org/10.22271/math.2025.v6.i1d.208
Pages: 318-321 | Views: 60 | Downloads: 17
Download Full Article: Click Here
How to cite this article:
Mobin Ahmad. A review on various techniques of numerical optimization. Journal of Mathematical Problems, Equations and Statistics. 2025; 6(1): 318-321. DOI: 10.22271/math.2025.v6.i1d.208
