Skip to main content
Springer Nature Link
Log in

Evaluating computational efficiency: A stochastic approach

  • Published:
Mathematical Programming Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper introduces the use of stochastic models for the evaluation of relative computational efficiency of algorithms. Such an approach is used for the comparison of computational efficiency of three algorithms for quadratic programming.

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

Access this article

Log in via an institution

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Benveniste, “A quadratic programming algorithm using conjugate search directions”,Mathematical Programming 16 (1979) 63–80.

    Google Scholar 

  2. R. Benveniste, “Quadratic programming using conjugate search directions”, unpublished Ph.D Thesis, University of London (1979), Chapter 6.

  3. A. Buckley, “An alternative implementation of Goldfarb's minimization algorithm”,Mathematical Programming 8 (1975) 207–231.

    Google Scholar 

  4. R. Fletcher and C.H. Reeves, “Function minimization by conjugate gradients”,Computer Journal 7 (1964) 149–154.

    Google Scholar 

  5. D. Goldfarb, “Extension of Davidon's variable metric algorithm to maximization under linear inequality and equality constraints”,SIAM Journal on Applied Mathematics (1969) 739–764.

  6. D.L. Isaacson and R.W. Madsen,Markovian chains theory and applications (John Wiley, New York, 1976).

    Google Scholar 

  7. B.A. Murtagh and M.A. Saunders, “Large scale linearly constrained optimization”,Mathematical Programming 14 (1978) 41–72.

    Google Scholar 

  8. M.J.D. Powell, “Quadratic termination properties of minimization algorithms. I. Statement and discussion of results”,Journal of the Institute of Mathematics and its Applications (1972) 333–342.

  9. M.J.D. Powell, “Quadratic termination properties of minimization algorithms. II. Proofs of theorems”,Journal of the Institute of Mathematics and its Applications (1972) 343–357.

  10. P. Wolfe, “Methods for non-linear programming” in: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York, 1963) pp. 67–86.

    Google Scholar 

  11. P. Wolfe, “Methods for linear constraints”, in: J. Abadie, ed.,Non-linear programming (North-Holland, Amsterdam, 1967) pp. 120–124.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Birmingham, P.O. Box 363, B15 2TT, Birmingham, United Kingdom

    Regina Benveniste

Authors
  1. Regina Benveniste
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benveniste, R. Evaluating computational efficiency: A stochastic approach. Mathematical Programming 22, 261–287 (1982). https://doi.org/10.1007/BF01581043

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words