A condition-based algorithm for solving polyhedral feasibility problems (Q457560)
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 condition-based algorithm for solving polyhedral feasibility problems |
scientific article; zbMATH DE number 6348916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A condition-based algorithm for solving polyhedral feasibility problems |
scientific article; zbMATH DE number 6348916 |
Statements
A condition-based algorithm for solving polyhedral feasibility problems (English)
0 references
29 September 2014
0 references
linear inequalities
0 references
Goldman-Tucker partition
0 references
interior-point methods
0 references
0 references
0 references
0.8137447834014893
0 references
0.795723557472229
0 references
0.7767202854156494
0 references
0.7766632437705994
0 references
0.7624804973602295
0 references
