Extension of Karmarkar’s Algorithm for Solving an Optimization Problem

  • El Amir Djeffal
  • Lakhdar Djeffal
  • Djamel Benterki
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 41)


In this paper, we propose an algorithm of an interior point method to solve a linear complementarity problem (LCP). The study is based on the transformation of a LCP into a convex quadratic problem; then we use the linearization approach to obtain the simplified problem of Karmarkar. Theoretical results deduct of those are established later, we show that this algorithm enjoys the best theoretical polynomial complexity, namely, \(O(n + m + 1)L,\ \) iteration bound. The numerical tests confirm that the algorithm is robust.


  1. 1.
    M. Achache, A weighted path-following method for the linear complementarity problem. Universitatis Babes-Bolyai, Series Informatica, 49 (1) (2004), 61–73.MathSciNetMATHGoogle Scholar
  2. 2.
    M. Achache, A new primal-dual path-following method for convex quadratic programming, Computational and Applied Mathematics, 25 (1) (2006), 97–110.MathSciNetMATHGoogle Scholar
  3. 3.
    M. Achache, Complexity analysis and numerical implementation of a short step primal-dual algorithm for linear complementarity problems, Applied Mathematics and Computation, 216 (2010), 1889–1895.MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    M. Achache, H. Roumili, A. Keraghel, A numerical study of an infeasible primal-dual path-following algorithm for linear programming, Applied Mathematics and Computation 186 (2007), 472–1479.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Y.Q. Bai, G. Lesaja, C. Roos, G.Q. Wang, M. El’Ghami, A class of large-update and small-update primal-dual interior point algorithms for linear optimization, Journal of Optimization Theory and Application, 138 (2008), 341–359.MathSciNetCrossRefGoogle Scholar
  6. 6.
    X. Chen, Smoothing methods for complementarity problem and their applications. a survey, Journal of the Operations Research Society of Japan, 43 (2000), 2–47.MathSciNetCrossRefGoogle Scholar
  7. 7.
    R.W. Cottle, J.S. Pang, R.E. Stone, The Linear Complementarity Problem, Academic Press, San Diego, 1992.MATHGoogle Scholar
  8. 8.
    Zs. Darvay, A new algorithm for solving self-dual linear programming problems. Studia Universitatis Babes-Bolyai, Series Informatica, 47 (2) (2002), 15–26.MATHGoogle Scholar
  9. 9.
    N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, 4 (1984), 373–395.MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Z. Kebbiche, A. Keraghel, A. Yassine, Extension of a projective interior point method for linearly constrained convex programming. Applied mathematics and Computation, 193 (2007), 553–559.MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    M. Kojima, S. Mizuno, A. Yoshise, A primal-dual interior point algorithm for linear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer Verlag, New York, 1989, pp.29–47.CrossRefGoogle Scholar
  12. 12.
    N. Megiddo, Pathways to the optimal set in linear programming, in: N. Megiddo (Ed.), Progress in Mathematical Programming: Interior Point and Related Methods, Springer Verlag, New York, 1989, pp.313–158.CrossRefGoogle Scholar
  13. 13.
    S. Mehrotra, On the implementation of a (primal-dual) interior point method, SIAM Journal on Optimization 2 (1992), 575–601.MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    B. Merikhi, Etude comparative de l’extension de l’algorithme de Karmarkar et des méthodes simpliciales pour la programmation quadratique convexe, Thèse de Magister, Institut de Mathématiques, University Ferhat Abbas, Sétif, Octobre 1994.Google Scholar
  15. 15.
    A. Nemirovskii, K. Scheinberg, Extension of Karmarkar’s algorithm onto convex quadratically constrained quadratic problems, Mathematical Programming: Series A, 72 (3) (1996), 273–289.MathSciNetMATHCrossRefGoogle Scholar
  16. 16.
    J. Peng, C. Roos, Terlaky, A new sufficient large-update interior point method for linear optimization, Journal of Computational and Technologies, 6 (4) (2001), 61–80.MathSciNetMATHGoogle Scholar
  17. 17.
    J. Peng, C. Roos, T. Terlaky, A New Paradigm for Primal-dual Interior-Point Methods, Princeton University Press, Princeton, NY, 2002.Google Scholar
  18. 18.
    Y. Qian, A polynomial predictor–corrector interior point algorithm for convex quadratic programming, Acta Mathematica Scientia, 26 B (2) (2006), 265–279.Google Scholar
  19. 19.
    C. Roos, T. Terlaky, J.Ph. Vial, Theory and algorithms for linear optimization, in: An Interior Approach, John Wiley and Sons, Chichester, UK, 1997.Google Scholar
  20. 20.
    S.J. Wright, Primal-dual Interior-Point Methods, SIAM, Philadelphia, USA, 1997.MATHCrossRefGoogle Scholar
  21. 21.
    Yinyu Ye, Interior Point Algorithms: Theory and Analysis, Wiley-Interscience, 1997.MATHGoogle Scholar
  22. 22.
    Y. Ye, E. Tse, An extension of Karmarkar’s projective algorithm for convex quadratic programming, Mathematical Programming, 44 (1989), 157–179.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • El Amir Djeffal
    • 1
  • Lakhdar Djeffal
    • 1
  • Djamel Benterki
    • 2
  1. 1.Hadj Lakhdar UniversityBatnaAlgeria
  2. 2.Ferhat Abbes UniversitySetifAlgeria

Personalised recommendations