By Topic

A recursive algorithm for discrete L1 linear estimation using the dual simplex method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Abdelmalek, N.N. ; Div. of Electr. Eng., Nat. Res. Council, Ottawa, Ont., Canada

One of the practical problems in engineering and science, is the estimation of parameters for a given experimental data. It is also often required to update the estimates as new points are added to or as old points are deleted from the given data set. For data containing wild points, parameter estimation using approximation in the L1 norm is usually recommended over other norms. It is shown that the updating of the estimates is calculated with very little effort using parametric programming techniques, applied to an existing L1, approximation algorithm which itself uses a dual simplex method. Thus an online adaptation for this algorithm is highly desirable. Numerical results and comments are given.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-15 ,  Issue: 6 )