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

DOI10.1109/TSMC.1985.6313457MaRDI QIDQ3706428zbMATH OpenOpenAlexFDO

Authors Nabih N. Abdelmalek

Publication date 1985

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsmc.1985.6313457

zbMATH Keywords

dual simplex methodexperimental dataparameter estimationparametric programmingrecursive algorithm

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Optimal recursive iterative algorithm for discrete nonlinear least-squares estimation
• Recursive algorithms for linear LMSE estimators under uncertain observations
• Approximation of discrete linear systems based on a dual criterion
• On a recursive regularized algorithm for estimation of parameters of a linear object
• An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
• An iterative algorithm for \(l_1\)-norm approximation in dynamic estimation problems
• Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
• An Improved Algorithm for Discrete l₁ Linear Approximation
• A primal-dual iterative algorithm for a maximum likelihood estimation problem

Cited in

(3)

• An on-line adaptation for discrete<tex>l_{1}</tex>linear estimation
• scientific article; zbMATH DE number 4050841 (Why is no real title available?)
• An iterative algorithm for \(l_1\)-norm approximation in dynamic estimation problems

This page was built for publication: A recursive algorithm for discrete L₁ linear estimation using the dual simplex method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706428)