A logarithmic barrier cutting plane method for convex programming (Q1904709): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: John A. Kaliski / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Tamás Terlaky / rank | |||
Normal rank | |||
Revision as of 07:20, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A logarithmic barrier cutting plane method for convex programming |
scientific article |
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
