A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (MCO (1), 2015)

An Efficient Primal-Dual Interior Point Method for Linear Programming Problems Based on a New Kernel Function with a Trigonometric Barrier Term. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (J. Optim. Theory Appl., 2016)

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (RAIRO Oper. Res., 2016)

An efficient parameterized logarithmic kernel function for linear optimization. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (Optim. Lett., 2018)

A new efficient short-step projective interior point method for linear programming. - Mousaab Bouafia; Djamel Benterki; Adnan Yassine (Oper. Res. Lett., 2018)

Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term. - Mousaab Bouafia; Adnan Yassine (RAIRO Oper. Res., 2022)

An efficient multi parametric kernel function for large and small-update methods interior point algorithm for P*(κ)-horizontal linear complementarity problem. - Mousaab Bouafia; Adnan Yassine (RAIRO Oper. Res., 2023)