Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Implementing a parallel constrained l_ 1 approximation algorithm

From MaRDI portal
Publication:1802663
Jump to:navigation, search

DOI10.1016/0167-8191(93)90010-IzbMATH Open0782.65011MaRDI QIDQ1802663FDOQ1802663

W. A. Essah, T. B. Boffey

Publication date: 28 February 1994

Published in: Parallel Computing (Search for Journal in Brave)





Recommendations

  • An Improved Algorithm for Discrete $l_1 $ Linear Approximation
  • Computational experience with an algorithm for discrete \(L_ 1\) approximation
  • A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
  • An \(L_{1}\) estimation algorithm with degeneracy and linear constraints.
  • scientific article


zbMATH Keywords

numerical resultsparallel computationcomparison of methodssimplex methodconstrained \(\ell_ 1\) approximation algorithm


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Linear programming (90C05) Algorithms for approximation of functions (65D15)







This page was built for publication: Implementing a parallel constrained \(l_ 1\) approximation algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1802663&oldid=14163284"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 09:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki