A numerical study of an infeasible primal-dual path-following algorithm for linear programming. - Mohamed Achache; H. Roumili; A. Keraghel (Appl. Math. Comput., 2007)

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems. - Mohamed Achache (Appl. Math. Comput., 2010)

A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization. - Mohamed Achache; Loubna Guerra (Appl. Math. Comput., 2014)

Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO. - Mohamed Achache; Moufida Goutali (Numer. Algorithms, 2015)

Complexity analysis of a weighted-full-Newton step interior-point algorithm for P∗(κ)-LCP. - Mohamed Achache (RAIRO Oper. Res., 2016)

A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems. - Mohamed Achache; Nesrine Tabchouche (Optim. Lett., 2019)

A path-following interior-point algorithm for monotone LCP based on a modified Newton search direction. - Welid Grimes; Mohamed Achache (RAIRO Oper. Res., 2023)

A Newton descent logarithmic barrier interior-point algorithm for monotone LCP. - Welid Grimes; Mohamed Achache; Adnan Yassine (RAIRO Oper. Res., 2024)

A Penalty Approach for Solving Generalized Absolute Value Equations. - Zahira Kebaili; Hassina Grar; Mohamed Achache (Axioms, 2025)

A theoretical and numerical study of an interior-point algorithm for convex quadratic semidefinite optimization. - Yasmina Bendaas; Mohamed Achache (RAIRO Oper. Res., 2025)