Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems (Q4895614)
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 935268
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems |
scientific article; zbMATH DE number 935268 |
Statements
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems (English)
0 references
14 October 1996
0 references
potential reduction
0 references
cutting planes
0 references
convergence
0 references
complexity
0 references
dual column generation algorithm
0 references
convex feasibility problems
0 references
separation oracle
0 references
fully polynomial approximation algorithm
0 references
0.8863809704780579
0 references
0.8560394048690796
0 references
0.8431947231292725
0 references
0.8423271775245667
0 references
