"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Arkadi NemirovskiLevent TunçelPublished in: Math. Program. (2005)
Keyphrases
- primal dual
- interior point methods
- interior point
- approximation algorithms
- algorithm for linear programming
- semidefinite programming
- linear programming
- convex optimization
- linear program
- linear programming problems
- semidefinite
- interior point algorithm
- convex programming
- variational inequalities
- convergence rate
- simplex algorithm
- search direction
- special case
- simplex method
- worst case
- analytic center
- valid inequalities
- objective function
- markov random field
- dynamic programming
- computational complexity
- support vector