Author:
Coleman Thomas F.,Li Yuying
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference21 articles.
1. E. Barnes, “A variation on Karmarkar's algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182.
2. I. Barrodale and F. Roberts, “An improved algorithm for discrete ℓ1 linear approximation,”SIAM Journal on Numerical Analysis 10 (1972 839–848.
3. R.H. Bartels, A.R. Conn and J.W. Sinclair, “Minimization techniques for piecewise differentiable functions: the ℓ1 solution to an overdetermined linear system,”SIAM Journal Numerical Analysis 15 (1978) 224–240.
4. C. Bischof, “QR factorization algorithms for coarse-grained distributed systems,” Technical Report 88-939, Cornell University (Ithaca, NY, 1988).
5. T.F. Coleman and P. Plassmann, “Solution of nonlinear least-squares problems on a multiprocessor,” in: G. van Zee and J. van de Vorst, eds.,Parallel Computing 1988, Shell Conference Proceedings, Lecture Notes in Computer Science No. 384 (Springer, Berlin, 1989).
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献