Skip to main content
SpringerLink
Log in

On the discovery and description of mathematical programming algorithms

  • Conference paper
  • First Online:
Book cover Numerical Analysis

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 506))

  • 1208 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Richard Bartels, Constrained Least Squares, Quadratic Programming, Complementary Pivot Programming and Duality, Proceedings of the 8th Annual Symposium on the Interface of Computer Science & Statistics, Health Science Computing Facility, Univ. of Calif., Los Angeles, Feb. 1975, pp. 267–271.

    Google Scholar 

  2. P.J. Denning, guest editor, ACM Computing Surveys, Special issue on programming, Vol 6, No. 4, (1974), pp. 209–319.

    Google Scholar 

  3. James K. Hightower, An Algorithm for Computing Restricted Least-Squares Estimates of Markov Transition Probabilities from Time-Series Data, Proceedings of the 8th Annual Symposium on the interface of Computer Science and Statistics, Health Science Computing Facility, Univ. of Calif., Los Los Angeles, Feb. 1975, pp. 238–241.

    Google Scholar 

  4. C.L. Lawson and R.J. Hanson, Solving Least Squares Problems, Prentice-Hall, Inc., (1974)

    Google Scholar 

  5. G.W. Stewart, Introduction to Matrix Computations, Academic Press, (1973).

    Google Scholar 

  6. Josef Stoer, On the Numerical Solution of Constrained Least-Squares Problems, SIAM J. Numer. Anal., Vol 8, No. 2, (1971), pp. 382–411.

    Article  MathSciNet  MATH  Google Scholar 

  7. Philip Wolfe, Algorithm for a Least-Distance Programming Problem, Mathematical Programming Study 1, (1974), pp. 190–205, North-Holland Publ. Co.

    Google Scholar 

Download references

Authors
  1. Charles L. Lawson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Alistair Watson

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

Lawson, C.L. (1976). On the discovery and description of mathematical programming algorithms. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080122

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07610-0

  • Online ISBN: 978-3-540-38129-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation