A feasible primal-dual interior point method for linear semidefinite programming. - Imene Touil; Djamel Benterki; Adnan Yassine (J. Comput. Appl. Math., 2017)

Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions. - Safa Guerdouh; Wided Chikouche; Imene Touil; Adnan Yassine (Kybernetika, 2023)

A novel kernel function bridging iteration bounds in interior-point algorithms for linear programming. - Imene Touil; Sajad Fathi Hafshejani (Kybernetika, 2025)