An infeasible interior-point algorithm for solving primal and dual geometric programs.
Kenneth O. KortanekXiaojie XuYinyu YePublished in: Math. Program. (1996)
Keyphrases
- interior point algorithm
- primal dual
- linear programming
- interior point methods
- linear program
- convex optimization
- duality gap
- algorithm for linear programming
- convergence rate
- simplex method
- approximation algorithms
- semidefinite programming
- dual formulation
- convex optimization problems
- dual variables
- high order
- special case
- search space
- integer programming
- column generation
- training data
- upper bound
- support vector