Skip to main content
Log in

An\(O(\sqrt n L)\) iteration bound primal-dual cone affine scaling algorithm for linear programmingiteration bound primal-dual cone affine scaling algorithm for linear programming

  • Published:
Mathematical Programming Submit manuscript

Abstract

In this paper we introduce a primal-dual affine scaling method. The method uses a search-direction obtained by minimizing the duality gap over a linearly transformed conic section. This direction neither coincides with known primal-dual affine scaling directions (Jansen et al., 1993; Monteiro et al., 1990), nor does it fit in the generic primal-dual method (Kojima et al., 1989). The new method requires\(O(\sqrt n L)\) main iterations. It is shown that the iterates follow the primal-dual central path in a neighbourhood larger than the conventional\(\mathcal{N}_2 \) neighbourhood. The proximity to the primal-dual central path is measured by trigonometric functions.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. Adler, M.G.C. Resende, G. Veiga and N.K. Karmarkar, “An implementation of Karmarkar's algorithm for linear programming,”Mathematical Programming 44 (1989) 297–335.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Den Hertog and C. Roos, “A survey of search directions in interior point methods for linear programming,”Mathematical Programming 52 (1991) 481–509.

    Article  MATH  MathSciNet  Google Scholar 

  3. I.I. Dikin, “Iterative solution of problems of linear and quadratic programming,”Soviet Mathematics Doklady 8 (1967) 674–675.

    MATH  Google Scholar 

  4. A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).

    MATH  Google Scholar 

  5. D. Goldfarb and D. Xiao, “A primal projective interior point method for linear programming,”Mathematical Programming 51 (1991) 17–43.

    Article  MATH  MathSciNet  Google Scholar 

  6. C.C. Gonzaga, “Conical projection algorithms for linear programming,”Mathematical Programming 43 (1989) 151–173.

    Article  MATH  MathSciNet  Google Scholar 

  7. C.C. Gonzaga, “Search directions for interior linear programming methods,”Algorithmica 6 (1991) 153–181.

    Article  MATH  MathSciNet  Google Scholar 

  8. C.C. Gonzaga, “The largest step path following algorithm for monotone linear complementarity problems,” Report 94-07, Delft University of Technology, (1994).

  9. J.N. Hooker, “Karmarkar's linear programming algorithm,”Interfaces 16 (1986) 75–90.

    Google Scholar 

  10. P. Huard, “Resolution of mathematical programming with nonlinear constraints by the method of centres,” in: J. Abadie, ed.Nonlinear Programming (North Holland, Amsterdam, 1967) pp. 207–219.

    Google Scholar 

  11. G-M. Jan and S-C Fang, “A new variant of the primal affine scaling algorithm for linear programs”,Optimization 22 (1991) 681–715.

    MATH  MathSciNet  Google Scholar 

  12. B. Jansen, C. Roos and T. Terlaky, “A polynomial primal-dual Dikin-type algorithm for linear programming,” Report 93-36, Delft University of Technology, (1993).

  13. B. Jansen, C. Roos, T. Terlaky and J.-Ph. Vial, “Interior-point methodology for linear programming: Duality, sensitivity analysis and computational aspects,” Report 93-28, Delft University of Technology, (1993).

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

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Kojima, N. Megiddo, T. Noma and A. Yoshise,A unified approach to interior point algorithms for linear complementarity problems, Lecture Notes in Computer Science, Vol. 538 (Springer, Berlin, 1991).

    Google Scholar 

  16. M. Kojima, S. Mizuno and 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, New York, 1989) pp. 29–48.

    Google Scholar 

  17. N. Megiddo, “On the complexity of linear programming,” in: T. Bewley, ed.,Advances in Economic Theory (Cambridge University Press, Cambridge, 1987) pp. 225–268.

    Google Scholar 

  18. S. Mizuno and A. Nagasawa, “A primal-dual affine scaling potential reduction algorithm for linear programming,”Mathematical Programming 62 (1993) 119–131.

    Article  MathSciNet  Google Scholar 

  19. S. Mizuno, M.J. Todd and Y. Ye, “On adaptive-step primal-dual interior-point algorithms for linear programming,”Mathematics of Operations Research (1993) 964–981.

  20. R.D.C. Monteiro and I. Adler, “Interior path following primal-dual algorithm,”Mathematical Programming 44 (1989) 27–42.

    Article  MATH  MathSciNet  Google Scholar 

  21. R.D.C. Monteiro, I. Adler and M.G.C. Resende, “A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,”Mathematics of Operations Research 15 (1990) 191–214.

    Article  MATH  MathSciNet  Google Scholar 

  22. M.W. Padberg, “Solution of a nonlinear programming problem arising in the projective method for linear programming,” Manuscript, School of Business and Administration, New York University (New York, 1985).

    Google Scholar 

  23. C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization, Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).

    MATH  Google Scholar 

  24. J. Renegar, “A polynomial-time algorithm, based on Newton's method, for linear programming,”Mathematical Programming 40 (1988) 59–93.

    Article  MATH  MathSciNet  Google Scholar 

  25. J.F. Sturm and S. Zhang, “New complexity results for the Iri-Imai method,” Research Memorandum 530, University of Groningen (Groningen, 1993). To appear inAnnals of Operations Research.

    Google Scholar 

  26. T. Tsuchiya, “Global convergence of the affine scaling methods for degenerate linear programming problems,”Mathematical Programming 52 (1991) 377–404.

    Article  MATH  MathSciNet  Google Scholar 

  27. T. Tsuchiya and M. Muramutsu, “Global convergence of the long-step affine scaling algorithm for degenerate linear programming problems,”SIAM Journal on Optimization 5 (1995) 525–551.

    Article  MATH  MathSciNet  Google Scholar 

  28. L. Tunçel “Constant potential primal-dual algorithm: A framework,”Mathematical Programming 66 (1994) 145–159.

    Article  MathSciNet  Google Scholar 

  29. H. Yamashita,A Polynomially and Quadratically Convergent Method for Linear Programming (Mathematical Systems Inc., Tokyo, 1986).

    Google Scholar 

  30. Y. Ye, “An O(n 3 L) potential reduction algorithm for linear programming,”Mathematical Programming 50 (1991) 239–258.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sturm, J.F., Zhang, S. An\(O(\sqrt n L)\) iteration bound primal-dual cone affine scaling algorithm for linear programmingiteration bound primal-dual cone affine scaling algorithm for linear programming. Mathematical Programming 72, 177–194 (1996). https://doi.org/10.1007/BF02592088

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation