The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (Q5216797)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7170194
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential |
scientific article; zbMATH DE number 7170194 |
Statements
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential (English)
0 references
20 February 2020
0 references
convex quadratic optimization
0 references
Wolfe's method
0 references
linear programming
0 references
strongly polynomial-time algorithms
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0.88343817
0 references
0.8821527
0 references
0.8813901
0 references
0.8782867
0 references
0.87803566
0 references
0.87681264
0 references
0.8704694
0 references
0.8661971
0 references
