A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481)
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 polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities |
scientific article; zbMATH DE number 1460613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities |
scientific article; zbMATH DE number 1460613 |
Statements
A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (English)
0 references
30 October 2000
0 references
analytic center
0 references
column generation
0 references
convex feasibility problem
0 references
potential reduction
0 references
