Linearly Constrained Discrete I1 Problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Linearly Constrained Discrete I₁ Problems

Full text

Pdf (713 KB)

Source

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

Pages: 594 - 608

Year of Publication: 1980

ISSN:0098-3500

Authors

Richard H. Bartels	Department of Computer Science, The University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Andrew R. Conn	Department of Computer Science, The University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

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/355921.355930 What is a DOI?

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	ARMSTRONG, R D, AND HULTZ, J.W. An algorithm for a restricted discrete approximation m the L~ norm. SIAM J Numer Anal. 14 (1977), 555-565
	2	BARTELS, R H, CONN, A.R, AND CHARALAMBOUS, C On Cline's direct method for solving overdetermined systems on the l~ sense SIAM J Numer Anal 15 (1978), 255-270.
	3	BARTELS, R H, CONN, A R, AND SINCLAIR, J.W. Minimization techmques for plecewise differentlable functions--The It solution to an overdetermined hnear system SIAM J Numer. Anal. 15 (1978), 224-241
	4	CONN, A R, AND PIETRZYKOWSKI, T. A penalty-function method converging directly to a constrained optimum SIAM J Numer Anal 14 (1977), 348-375
	5	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	6	C. L. Lawson , R. J. Hanson , D. R. Kincaid , F. T. Krogh, Basic Linear Algebra Subprograms for Fortran Usage, ACM Transactions on Mathematical Software (TOMS), v.5 n.3, p.308-323, Sept. 1979 [doi>10.1145/355841.355847]
	7	RYDER, B.G. The PFORT verifier. Software Practice and Experzence 4 (1974), 359-377

CITED BY 4

	David C. Hoaglin , Virginia Klema , Stephen C. Peters, Exploratory Data Analysis in a Study of the Performance of Nonlinear Optimization Routines, ACM Transactions on Mathematical Software (TOMS), v.8 n.2, p.145-162, June 1982
	Roger W. Koenker , Pin T. Ng, A remark on Bartels and Conn's linearly constrained, discrete l1 problems, ACM Transactions on Mathematical Software (TOMS), v.22 n.4, p.493-495, Dec. 1996
	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
	Richard H. Bartels , Andrew R. Conn, Algorithm 563: A Program for Linearly Constrained Discrete I1 Problems, ACM Transactions on Mathematical Software (TOMS), v.6 n.4, p.609-614, Dec. 1980