1. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
2. Sonnevend G. An ‘analytic center’ for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming. In: Prekopa A, Szelezsan J, Strazicky B, editors. System Modelling and Optimization: Proceedings of the 12th IFIP-Conference; 1985; Budapest, Hungary. Berlin: Springer-Verlag; 1986. p. 866–876. (Lecture notes in control and information science; 84.
3. Pathways to the Optimal Set in Linear Programming
4. El Ghami M. New primal–dual interior-point methods based on kernel functions. Certificat d'Etudes approfondies Mathematiques (C.E.A). Universite Mohammed V, Rabat, Marokko; 2005.
5. A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization