A logarithmic barrier cutting plane method for convex programming.
Dick den HertogJohn KaliskiCees RoosTamás TerlakyPublished in: Ann. Oper. Res. (1995)
Keyphrases
- convex programming
- cutting plane method
- interior point methods
- convex optimization
- linear programming
- linear program
- primal dual
- semidefinite programming
- quadratic programming
- computationally intensive
- solving problems
- worst case
- semidefinite
- max flow
- optimal solution
- approximation algorithms
- singular value decomposition
- upper bound
- np hard