You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
HUBER'S M-ESTIMATOR ON UNDERDETERMINED PROBLEMS
Wang Jia-song and Tang Sheng-rong
Journal of Computational Mathematics
Vol. 13, No. 2 (APRIL 1995), pp. 130-143
Stable URL: http://www.jstor.org/stable/43692610
Page Count: 14
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
After surveying the theoretical aspects of Huber's M-estimator on underdetermined problems, two finite algorithms are presented. Both proceed in a constructive manner by moving from one partition to an adjacent one. One of the algorithm, which uses the tuning constant as a continuation parameter, also has the facility to simultaneously estimate the tuning constant and scaling factor. Stable and efficient implementation of the algorithms is presented together with numerical results. The L₁-norm problem is mentioned as a special case.
Journal of Computational Mathematics © 1995 Institute of Computational Mathematics and Scientific/Engineering Computing