A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144)
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: A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio |
scientific article; zbMATH DE number 440086
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio |
scientific article; zbMATH DE number 440086 |
Statements
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (English)
0 references
6 December 1993
0 references
fixed dimension optimization
0 references
Clarkson's randomized algorithm
0 references
interior point method
0 references
