메뉴 건너뛰기




Volumn 8, Issue 2, 1979, Pages 175-190

A Revised Simplex Algortihm for the Absolute Deviation Curve Fitting Problem

Author keywords

C.1 approximation; least absolute values estimation; programming; rearessiom linear

Indexed keywords


EID: 84948485872     PISSN: 03610918     EISSN: 15324141     Source Type: Journal    
DOI: 10.1080/03610917908812113     Document Type: Article
Times cited : (67)

References (12)
  • 1
    • 0014980004 scopus 로고
    • Linear 1 approximation for a discrete point set and L solutions of over determined linear equations
    • Abdelmalek, N. M. (1971). Linear 1 approximation for a discrete point set and L solutions of over determined linear equations. J. Assoc. Comput. Mach. 18, 41-7.
    • (1971) J. Assoc. Comput. Mach. , vol.18 , pp. 41
    • Abdelmalek, N.M.1
  • 2
    • 0000308721 scopus 로고
    • A Comparison of two algorithms for absolute deviation curve fitting
    • Armstrong, R. D. and Frome, E. L. (1976). A Comparison of two algorithms for absolute deviation curve fitting. J. Amer. Statist. Assoc. 71, 328–30.
    • (1976) J. Amer. Statist. Assoc. , vol.71 , pp. 328-330
    • Armstrong, R.D.1    Frome, E.L.2
  • 4
    • 0000657061 scopus 로고    scopus 로고
    • Algorithms for best L1 and L∞ linear approximation on a discrete set
    • Barrodale, I. and Young, A. (1966). Algorithms for best L1 and L∞ linear approximation on a discrete set. Numer. Math. 8, 295-° 306.
    • Numer. Math. , vol.8 , pp. 295-306
    • Barrodale, I.1    Young, A.2
  • 5
    • 0001637146 scopus 로고    scopus 로고
    • The simplex method of linear programming using LU decomposition
    • Bartels, R. H. and Golub, G. H. (1969). The simplex method of linear programming using LU decomposition. Communications of the ACM 12, 266–8.
    • Communications of the ACM , vol.12 , pp. 266-268
    • Bartels, R.H.1    Golub, G.H.2
  • 7
    • 0001741165 scopus 로고    scopus 로고
    • Optimal estimation of executive compensation by linear programming
    • Charnes, A., Cooper, W. W. and Ferguson, R. (1955). Optimal estimation of executive compensation by linear programming. Management Sci. 7, 138–51.
    • Management Sci. , vol.7 , pp. 138-151
    • Charnes, A.1    Cooper, W.W.2    Ferguson, R.3
  • 8
    • 11744366836 scopus 로고    scopus 로고
    • An interval programming algorithm for discrete linear L1 approximation problems
    • Robers, P, D. and Ben-Israel, A. (1969). An interval programming algorithm for discrete linear L1 approximation problems, J. Approx. Theory 2, 323–36.
    • J. Approx. Theory , vol.2 , pp. 323-336
    • Robers1    Ben-Israel, A.2
  • 9
    • 84891815019 scopus 로고
    • An iterative technique for absolute deviations curve fitting
    • Schlossmacher, E. J. (1973). An iterative technique for absolute deviations curve fitting. J. Amer. Statist. Assoc. 68, 857–9
    • (1973) J. Amer. Statist. Assoc. , vol.68 , pp. 857-859
    • Schlossmacher, E.J.1
  • 10
  • 11
    • 34249304582 scopus 로고    scopus 로고
    • On L approximation II; computation for discrete functions and ditcretization effects
    • Usow, K. H. (1967). On L approximation II; computation for discrete functions and ditcretization effects. SIAM J. Numer. Anal, 4, 233–44.
    • SIAM J. Numer. Anal , vol.4 , pp. 233-244
    • Usow, K.H.1
  • 12
    • 0001351879 scopus 로고    scopus 로고
    • Linear programming techniques for regression analysis
    • Wagner, H. M. (1959). Linear programming techniques for regression analysis, J. Amer. Statist. Assoc. 54, 206–12.
    • J. Amer. Statist. Assoc. , vol.54 , pp. 206-212
    • Wagner, H.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.