On the discovery and description of mathematical programming algorithms
Part of the Lecture Notes in Mathematics book series (LNM, volume 506)
- 808 Downloads
KeywordsMarkov Transition Probability Algorithm NNLS Problem NNLS Mathematical Programming Literature Minimal Euclidean Length
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 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
- 7.Philip Wolfe, Algorithm for a Least-Distance Programming Problem, Mathematical Programming Study 1, (1974), pp. 190–205, North-Holland Publ. Co.Google Scholar
© Springer-Verlag 1976