A Comparative Numerical Study between Minorant Functions and Line Search Methods in Penalty Methods for Linear Optimization-Reference-Cited by-同舟云学术

A Comparative Numerical Study between Minorant Functions and Line Search Methods in Penalty Methods for Linear Optimization

Published:2023-02-05 Issue:1 Volume:13 Page:10073-10077
ISSN:1792-8036
Container-title:Engineering, Technology & Applied Science Research
language:
Short-container-title:Eng. Technol. Appl. Sci. Res.

Author:

Leulmi Assma

Abstract

The aim of this paper is to present a comparative numerical study between the minorant functions and line search methods in computing the step size in the penalty method for linear optimization. The minorant functions were confirmed by many interesting numerical experimentations to be more beneficial than the classical line search methods.

Publisher

Engineering, Technology & Applied Science Research

Subject

General Medicine

Reference16 articles.

1. M. Achache, "A polynomial-time weighted path-following interior-point algorithm for linear optimization," Asian-European Journal of Mathematics, vol. 13, no. 2, Mar. 2020, Art. no. 2050038.

2. P. Armaos, "A Study of Joint Cost Inclusion in Linear Programming Optimization," Engineering, Technology & Applied Science Research, vol. 3, no. 4, pp. 473–478, Aug. 2013.

3. B. Badri-Koohi, R. Tavakkoli-Moghaddam, and M. Asghari, "Optimizing Number and Locations of Alternative-Fuel Stations Using a Multi-Criteria Approach," Engineering, Technology & Applied Science Research, vol. 9, no. 1, pp. 3715–3720, Feb. 2019.

4. M. Bouafia, D. Benterki, and A. Yassine, "A new efficient short-step projective interior point method for linear programming," Operations Research Letters, vol. 46, no. 3, pp. 291–294, May 2018.

5. J.-P. Crouzeix and B. Merikhi, "A logarithm barrier method for semi-definite programming," RAIRO - Operations Research, vol. 42, no. 2, pp. 123–139, Apr. 2008.