A logarithmic barrier cutting plane method for convex programming (Q1904709)
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 830134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A logarithmic barrier cutting plane method for convex programming |
scientific article; zbMATH DE number 830134 |
Statements
A logarithmic barrier cutting plane method for convex programming (English)
0 references
2 May 1996
0 references
column generation
0 references
decomposition
0 references
interior point method
0 references
nonsmooth optimization
0 references
logarithmic barrier cutting plane algorithm
0 references
central path of a linear relaxation
0 references
0 references
0 references
0.8373525142669678
0 references
0.8365447521209717
0 references
0.82243812084198
0 references
0.82243812084198
0 references
0.8203000426292419
0 references
