L/sub 1/ and L/sub infinity / minimization via a variant of Karmarkar's algorithm
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 37 (2), 245-253
- https://doi.org/10.1109/29.21687
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A modification of karmarkar's linear programming algorithmAlgorithmica, 1986
- Fast adaptive filters: A geometrical approachIEEE ASSP Magazine, 1986
- Linear prediction of speech with a least absolute error criterionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- An on-line adaptation for discretel_{1}linear estimationIEEE Transactions on Automatic Control, 1984
- Lattice methods for spectral estimationProceedings of the IEEE, 1982
- Lattice filters for adaptive processingProceedings of the IEEE, 1982
- AR and ARMA identification algorithms of Levinson type: An innovations approachIEEE Transactions on Automatic Control, 1981
- Robust StatisticsWiley Series in Probability and Statistics, 1981
- Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear SystemSIAM Journal on Numerical Analysis, 1978