Benhadid Ayache ; Saoudi Khaled
-
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration boundArticle
Authors: Benhadid Ayache ; Saoudi Khaled
NULL##NULL
Benhadid Ayache;Saoudi Khaled
In this paper, we propose a large-update primal-dual interior point algorithm for linear optimization. The method is based on a new class of kernel functions which differs from the existing kernel functions in which it has a double barrier term. The investigation according to it yields the best known iteration bound O n log ( n ) log ( n ∈ ) \sqrt n \log (n)\log \left( {{n \over \in }} \right) for large-update algorithm with the special choice of its parameter m and thus improves the iteration bound obtained in Bai et al. [2] for large-update algorithm.
Imene Touil;Wided Chikouche;Djamel Benterki;Amina Zerari, 2024, An Efficient Hyperbolic Kernel Function Yielding the Best Known Iteration Bounds for Linear Programming, Acta Mathematicae Applicatae Sinica English Series, 41, 1, pp. 133-151, 10.1007/s10255-024-1146-z.
Jong-Kyu Lee;You-Young Cho;Jin-Hee Jin;Gyeong-Mi Cho, 2023, A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem, Optimization Letters, 18, 4, pp. 943-964, 10.1007/s11590-023-02025-5, https://doi.org/10.1007/s11590-023-02025-5.
Ayache Benhadid;Fateh Merahi, 2022, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Numerical Algebra Control and Optimization, 13, 2, pp. 224-238, 10.3934/naco.2022003, https://doi.org/10.3934/naco.2022003.