Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming-Reference-Cited by-同舟云学术

Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming

Published:2020-09-08 Issue:1 Volume:49 Page:15-21
ISSN:2501-059X
Container-title:Journal of Numerical Analysis and Approximation Theory
language:
Short-container-title:J. Numer. Anal. Approx. Theory

Author:

Chaghoub Soraya,Benterki Djamel

Abstract

This paper presents a comparative numerical study between line search methods and majorant functions to compute the displacement step in barrier logarithmic method for linear programming. This study favorate majorant function on line search which is promoted by numerical experiments.

Publisher

Academia Romana Filiala Cluj

Reference10 articles.

1. D. Benterki, J.P. Crouzeix and B. Merikhi, A numerical feasible interior point method for linear semidefinite programs, RAIRO-Operation research,41, (2007), pp. 49–59, https://doi.org/10.1051/ro:2007006

2. M. Bouafia D. Benterki and A. Yassine, A new efficient short-step projective interior point method for linear programming, Operations Research Letters 46, (2018), pp. 291–294, https://doi.org/10.1016/j.orl.2018.02.004

3. M. Bouafia D. Benterki and A. Yassine, An efficient parameterized logarithmic kernel function for linear optimization, Optim Lett, 12, (2018), pp. 1079–1097, https://doi.org/10.1007/s11590-017-1170-5

4. M. Bouafia and A. Yassine, An efficient twice parameterized trigonometric kernel function for linear optimization, Optimization and Engineering, (2019), https://doi.org/10.1007/s11081-019-09467-w

5. L.B. Cherif and B. Meikhi, A penalty method for nonlinear programming, RAIRO - Oper. Res. 53, (2019) pp. 29–38, https://doi.org/10.1051/ro/2018061