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 the normal view instead:
scientific article; zbMATH DE number 941331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9015676975250244
0 references
0.8855000138282776
0 references
0.8842357993125916
0 references
0.8841740489006042
0 references
0.884059727191925
0 references
