Implementing a parallel constrained \(l_ 1\) approximation algorithm (Q1802663)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implementing a parallel constrained \(l_ 1\) approximation algorithm |
scientific article; zbMATH DE number 205172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementing a parallel constrained \(l_ 1\) approximation algorithm |
scientific article; zbMATH DE number 205172 |
Statements
Implementing a parallel constrained \(l_ 1\) approximation algorithm (English)
0 references
28 February 1994
0 references
The aim of this paper is to describe a parallel implementation of the constrained \(\ell_ 1\) approximation algorithm of \textit{I. Barrodale} and \textit{F. D. K. Roberts} [SIAM J. Numer. Anal. 15, 603-611 (1978; Zbl 0387.65027)]. The mathematical basis of the Barrodale-Roberts (BR) algorithm is presented in the introduction. The second section deals with the BR strategy via examples. The third part is dedicated to parallel implementation. The fourth part deals with numerical results. Eight problems are solved and compared both by Simplex02 and by the authors' algorithm. The new algorithm seems to be very much faster than the standard simplex method.
0 references
parallel computation
0 references
comparison of methods
0 references
constrained \(\ell_ 1\) approximation algorithm
0 references
numerical results
0 references
simplex method
0 references
