Skip to main content
SpringerLink
Log in

Computational complexity of a piecewise linear homotopy algorithm

  • Published:
Mathematical Programming Submit manuscript

Abstract

We give a bound on the number of steps required by the piecewise linear algorithm based on component wise homotopy (proposed by the author for structured problems) when solving a linear problem. When the coefficient matrix is symmetric and positive definite, this bound is polynomial inn and linear in the condition number of the matrix. We also investigate the expected value of the bound for a particular distribution of such matrices.

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

Access this article

Log in via an institution

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. B.C. Eaves and R. Saigal, “Homotopies for computation of fixed points in unbounded regions”,Mathematical Programming 3 (1972) 225–237.

    Article  MATH  MathSciNet  Google Scholar 

  2. P.R. Halmos,Measure Theory (Van Nostrand, Princeton, NJ, 1950).

    MATH  Google Scholar 

  3. G. van der Laan and A.J.J. Talman, “A restart algorithm without an artificial level for computing fixed points on unbounded regions”, in: H.O. Pietgen and H.O. Walther, eds.,Functional Differential Equations and Approximation of Fixed Points, Lecture Notes in Mathematics 730 (Springer, Berlin, 1979) pp. 247–256.

    Chapter  Google Scholar 

  4. O.H. Merrill, Applications and extensions of an algorithm that computes fixed points of certain upper semi-continuous point-to-set mappings” Ph.D. Dissertation, Department of Industrial Engineering, University of Michigan (Ann Arbor, MI, 1972).

    Google Scholar 

  5. K.G. Murty, “Computational complexity of complementary pivot methods”,Mathematical Programming Study 7 (1978) 61–73.

    MATH  MathSciNet  Google Scholar 

  6. R. Saigal, “Investigations into the efficiency of fixed point algorithms”, in: S. Karamardian, ed.,Fixed Points—Algorithms and Applications, (Academic Press, New New York, 1977), pp. 203–223.

    Google Scholar 

  7. R. Saigal, “On paths generated by fixed point algorithms”,Mathematics of Operations Research 1 (1976) 359–380.

    Article  MATH  MathSciNet  Google Scholar 

  8. R. Saigal, “A homotopy for solving large, sparse and structured fixed point problems”Mathematics of Operations Research, to appear.

  9. S. Smale, “The fundamental theorem of algebra and complexity theory”,Bulletin of the American Mathematical Society 4 (1981) 1–36.

    Article  MATH  MathSciNet  Google Scholar 

  10. G.W. Stewart, “The efficient generation of random orthogonal matrices with an application to condition estimators”,SIAM Journal on Numerical Analysis 17 (1980) 403–409.

    Article  MATH  MathSciNet  Google Scholar 

  11. M.J. Todd, “On the computational complexity of piecewise linear homotopy algorithms”,Mathematical Programming 24 (1982) 216–224.

    Article  MATH  MathSciNet  Google Scholar 

  12. Y. Yamamoto, “A new variable dimension algorithm for the fixed point problem”,Mathematical Programming 25 (1983) 329–342.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Northwestern University, 60201, Evanston, IL, USA

    R. Saigal

Authors
  1. R. Saigal
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been partially supported by the grant MCS 80-05154 from the National Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Saigal, R. Computational complexity of a piecewise linear homotopy algorithm. Mathematical Programming 28, 164–173 (1984). https://doi.org/10.1007/BF02612356

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation