Solving nonlinear optimization problem using approximation methods

https://doi.org/10.53730/ijhs.v6nS3.5699

Authors

  • Abbas Musleh Salman Mathematics Department, University of Babylon
  • Ahmed Sabah Al-Jilawi Mathematics Department, University of Babylon

Keywords:

optimization, nonlinear optimization, relaxation

Abstract

The goal of this paper is to find a better method for integrating the optimization problem faster, and we did so by using a relaxation of the solution area, which is one of the methodologies in the correlation between the penalty method and the Augmented Lagrange method, and we also built default properties for combining these two methods.

Downloads

Download data is not yet available.

References

A. Fiacco and G. McCormick, Sequential unconstrained minimization techniques for nonlinear programming, A primal dual method. Munagement Sci, 10 (1968).

Angelo Miele, EE Cragg, RR Iyer, and AV Levy. Use of the augmented penalty function inmathematical programming problems, part 1. Journal of Optimization Theory and Applications, 8(2):115–130, 1971.

Andrzej Ruszczynski. Nonlinear optimization. Princeton university press, 2011.

Christian Kanzow, Daniel Steck, and Daniel Wachsmuth. An augmented lagrangian method for optimization problems in banach spaces. SIAM Journal on Control and Optimization,

(1):272–291, 2018.

Dimitri P Bertsekas and Athena Scientific. Convex optimization algorithms. Athena Scientific Belmont, 2015.

D. P. Bertsekas, Nonlinear programming, Athena scienti_c Belmont, 1999.

Judah Ben Rosen, Olvi L Mangasarian, and Klaus Ritter. Nonlinear Programming: Proceedings of a Symposium Conducted by the Mathematics Research Center, the University of Wisconsin, Madison, May 4-6, 1970. Number 25. Elsevier, 2014.

JB Hiriart-Urruty and C Lemaréchal. Convex analysis and minimization algorithms. no. 305- 306 in grund. der math. wiss, 1993.

M. M. El-Alem, A global convergence theory for a class of trust region algorithms for constrained optimization, PhD thesis, Rice University, 1988.

Michael James Lowe. Nonlinear programming: augmented Lagrangian techniques for constrained minimization. PhD thesis, Montana State University-Bozeman, College of Engineering, 1974.

P Dimitri Bertsekas. Nonlinear programming. 1999. Athena, Scientific, Belmont CA.

Al-Jilawi, A. S., & Abd Alsharify, F. H. (2022). Review of Mathematical Modelling Techniques with Applications in Biosciences. Iraqi Journal For Computer Science and Mathematics, 3(1), 135-144.‏

Alridha, A., Wahbi, F. A., & Kadhim, M. K. (2021). Training analysis of optimization models in machine learning. International Journal of Nonlinear Analysis and Applications, 12(2), 1453-1461.‏

Kadhim, M. K., Wahbi, F. A., & Hasan Alridha, A. (2022). Mathematical optimization modeling for estimating the incidence of clinical diseases. International Journal of Nonlinear Analysis and Applications, 13(1), 185-195.‏

Alridha, A., Salman, A. M., & Al-Jilawi, A. S. (2021, March). The Applications of NP-hardness optimizations problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012179). IOP Publishing.‏

Salman, A. M., Alridha, A., & Hussain, A. H. (2021, March). Some Topics on Convex Optimization. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012171). IOP Publishing.‏

Alridha, A., & Al-Jilawi, A. S. (2021, March). Mathematical Programming Computational for Solving NP-Hardness Problem. In Journal of Physics: Conference Series (Vol. 1818, No. 1, p. 012137). IOP Publishing.‏

Alridha, A. H., & Al-Jilawi, A. S. (2022). Solving NP-hard problem using a new relaxation of approximate methods. International Journal of Health Sciences, 6(S3), 523–536. https://doi.org/10.53730/ijhs.v6nS3.5375

Published

08-04-2022

How to Cite

Salman, A. M., & Al-Jilawi, A. S. (2022). Solving nonlinear optimization problem using approximation methods. International Journal of Health Sciences, 6(S3), 1578–1586. https://doi.org/10.53730/ijhs.v6nS3.5699

Issue

Section

Peer Review Articles