Faster maximum feasible subsystem solutions for dense constraint matrices (Q2669801)
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: Faster maximum feasible subsystem solutions for dense constraint matrices |
scientific article; zbMATH DE number 7486443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster maximum feasible subsystem solutions for dense constraint matrices |
scientific article; zbMATH DE number 7486443 |
Statements
Faster maximum feasible subsystem solutions for dense constraint matrices (English)
0 references
9 March 2022
0 references
maximum feasible subsystem
0 references
linear programming
0 references
classification
0 references
compressive sensing
0 references
0 references
0 references
0.8868980407714844
0 references
0.7928529381752014
0 references
0.7915997505187988
0 references
0.7824267745018005
0 references
