Algorithm 552: Solution of the Constrained I1 Linear Approximation Problem [F4]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 552: Solution of the Constrained I₁ Linear Approximation Problem [F4]

Full text

Pdf (264 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 2 (June 1980) table of contents

Pages: 231 - 235

Year of Publication: 1980

ISSN:0098-3500

Authors

I. Barrodale	Department of Mathematics, University of Victoria, P.O. Box 1700, Victoria, B.C, Canada V8W 2Y2
F. D. K. Roberts	Department of Mathematics, University of Victoria, P.O. Box 1700, Victoria, B.C, Canada V8W 2Y2

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 52, Citation Count: 4

Additional Information:

appendices and supplements references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355887.355896 What is a DOI?

APPENDICES and SUPPLEMENTS

CL1 (552.gz) (5 KB)

modified simplex method: L1 solution to linear equations subject to linear equality and inequality constraints
Gams: D9a3,D9b3

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	BARRODALE, I., AND ROBERTS, F.D.K An improved algorithm for discrete l~ linear approximation. SIAM J Numer. Anal. 10 (1973), 839-848.
	2	I. Barroda , F. D. K. Roberts, Solution of an overdetermined system of equations in the l1 norm [F4], Communications of the ACM, v.17 n.6, p.319-320, June 1974 [doi>10.1145/355616.361024]
	3	BARRODALE, I., AND ROBERTS F.D.K. An efficient algorithm for discrete l~ linear approximation with linear constraints. SIAM J. Numer Anal. 15 (1978), 603-611.
	4	BARTELS, R.H., CONN, A.R., AND SINCLAIR, J.W Minimization techniques for piecewise differentlable functions: The Ii solution to an overdetermined hnear system. SIAM J. Numer. Anal 15 (1978), 224-241.
	5	}~KBLOM, H. Lp methods for robust regression. BIT 14 (1974), 22-32.
	6	HADLEY, G. L~near Programming. Addison-Wesley, Reading, Mass., 1962
	7	I:~ICE, J.l:~., AND WHITE, J S. Norms for smoothing and estimation. SIAM ReD. 6 (1964), 243- 256

CITED BY 4

	Gleb Beliakov, Learning Weights in the Generalized OWA Operators, Fuzzy Optimization and Decision Making, v.4 n.2, p.119-130, April 2005
	R. D. Armstrong , P. O. Beck , M. T. Kung, Algorithm 615: the best subset of parameters in leasst absolute value regression, ACM Transactions on Mathematical Software (TOMS), v.10 n.2, p.202-206, June 1984
	Charles Dunham, Applications of best approximation, ACM SIGNUM Newsletter, v.26 n.2, p.2-10, April 1991
	Mingren Shi , Mark A. Lukas, An L1 estimation algorithm with degeneracy and linear constraints, Computational Statistics & Data Analysis, v.39 n.1, p.35-55, 28 March 2002