Skip to main content
Log in

Asymptotic behaviour of Karmarkar's method for linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

The asymptotic behaviour of Karmarkar's method is studied and an estimate of the rate of the objective function value decrease is given. Two possible sources of numerical instability are discussed and a stabilizing procedure is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.M. Anstreicher, “The worst-case step in Karmarkar's algorithm,” unpublished manuscript, Yale School of Organization and Management (New Haven, CT, 1986).

    Google Scholar 

  2. M.D. Asic, V.V. Kovacevic-Vujcic and M.D. Radosavljevic-Nikolic, “Karmarkarov algoritam: analiza numericke stabilnosti i neke modifikacije,” in:Proceedings of the 12th Yugoslav Symposium on Operations Research (Herceg-Novi, Yugoslavia, October 1985) pp. 33–41.

    Google Scholar 

  3. M.D. Asic, V.V. Kovacevic-Vujcic and M.D. Radosavljevic-Nikolic, “Asimptotsko ponasanje Karmarkarove metode,” in:Proceedings of the 13th Yugoslav Symposium on Operations Research (Herceg-Novi, Yugoslavia, October 1986) pp. 81–88.

    Google Scholar 

  4. E.R. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.

    Google Scholar 

  5. C. Blair, “The iterative step in the linear programming algorithm of N. Karmarkar,”Algorithmica 1 (1986) 537–539.

    Google Scholar 

  6. L. Blum, “Towards an asymptotic analysis of Karmarkar's algorithm,” unpublished manuscript, University of California (Berkeley, CA, 1985).

    Google Scholar 

  7. J.E. Dennis, A.M. Morshedi and K. Turner, “A variable metric variant of the Karmarkar algorithm for linear programming,”Mathematical Programming 39 (1987) 1–20.

    Google Scholar 

  8. I.I. Dikin, “O shodimosti odnovo iteracionovo procesa,” Upravljaemye sistemy 12 (1974) 54–60.

    Google Scholar 

  9. I.M. Gel'fand,Lectures on Linear Algebra (Interscience, New York, 1967).

    Google Scholar 

  10. P. Gill, W. Murray, M. Saunders, J. Tomlin and M. Wright, “On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,”Mathematical Programming 36 (1986) 183–209.

    Google Scholar 

  11. D. Goldfarb and S. Mehrotra, “Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value,”Mathematical Programming 40 (1988) 183–196.

    Google Scholar 

  12. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” unpublished manuscript, AT&T Bell Laboratories (New Jersey, 1984).

    Google Scholar 

  13. N. Karmarkar, “A new polynomial-time algorithm for linear programming,”Combinatorica 4(4) (1984) 373–395.

    Google Scholar 

  14. L.G. Khachian, “A polynomial algorithm for linear programming,”Soviet Mathematics Doklady 20 (1979) 191–194.

    Google Scholar 

  15. K.O. Kortanek and M. Shi, “Convergence results on a linear programming hybrid algorithm,”European Journal of Operational Research 32 (1987) 47–61.

    Google Scholar 

  16. C. McDiarmid, “On the improvement per iteration in Karmarkar's algorithm for linear programming,” unpublished manuscript, Rutgers University (New Brunswick, NJ, 1987).

    Google Scholar 

  17. N. Megiddo, “Introduction: New approaches to linear programming,”Algorithmica 1 (1986) 387–394.

    Google Scholar 

  18. N. Megiddo and M. Shub, “Boundary behaviour of interior point algorithms in linear programming,” IBM Research Report RJ 5319, Almaden Research Center (San Jose, CA, 1986).

    Google Scholar 

  19. W. Nickels, W. Rödder, L. Xu and H.J. Zimmermann, “Intelligent gradient search in linear programming,”European Journal of Operational Research 22 (1985) 293–303.

    Google Scholar 

  20. C. Roos, “On Karmarkar's projective method for linear programming”, Reports of the Department of Mathematics and Informatics 85-23, Delft University (Delft, the Netherlands, 1985).

    Google Scholar 

  21. H. Schreck, “Experiments with an implementation of Karmarkar's linear programming algorithm,” in: M. M.J. Beckmann, K.-W. Gaede, K. Ritter and H. Schneeweiss, eds.,Proceedings of the 10th Symposium on Operations Research, Methods of Operations Research, Vol. 54 (1985) pp. 535–542.

    Google Scholar 

  22. H.D. Sherali, “Algorithmic insights and a convergence analysis for Karmarkar-type of algorithm for linear programming problems,” unpublished manuscript, Virginia Polytechnic Institute (Blacksburg, VI, 1985).

    Google Scholar 

  23. M.J. Todd and B.P. Burrell, “An extension of Karmarkar's algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424.

    Google Scholar 

  24. R.J. Vanderbei, M.S. Meketon and B.A. Freedman, “A modification of Karmarkar's linear programming algorithm,”Algorithmica 1 (1986) 395–407.

    Google Scholar 

  25. J.H. Wilkinson,Rounding Errors in Algebraic Processes (Prentice-Hall, Englewood Cliffs, NJ, 1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research supported in part by Republicka zajednica za nauku SR Srbije.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Asic, M.D., Kovacevic-Vujcic, V.V. & Radosavljevic-Nikolic, M.D. Asymptotic behaviour of Karmarkar's method for linear programming. Mathematical Programming 46, 173–190 (1990). https://doi.org/10.1007/BF01585736

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585736

Key words

Navigation