A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01582137 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985372427 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 30 July 2024
scientific article
| 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 |
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
