A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078)
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 note on some analytic center cutting plane methods for convex feasibility and minimization problems |
scientific article; zbMATH DE number 941331
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on some analytic center cutting plane methods for convex feasibility and minimization problems |
scientific article; zbMATH DE number 941331 |
Statements
A note on some analytic center cutting plane methods for convex feasibility and minimization problems (English)
0 references
10 April 1997
0 references
nondifferentiable optimization
0 references
cutting plane methods
0 references
complexity of an analytic center algorithm
0 references
convex feasibility problems
0 references
separation oracle
0 references
box constraints
0 references
complexity estimates
0 references
0 references
