A truncated primal-infeasible dual-feasible network interior point method.
Luis F. PortugalMauricio G. C. ResendeGeraldo VeigaJoaquim JúdicePublished in: Networks (2000)
Keyphrases
- primal dual
- interior point methods
- dual feasible
- linear programming
- linear program
- convex optimization
- interior point algorithm
- linear programming problems
- convex programming
- approximation algorithms
- optimal solution
- inequality constraints
- simplex method
- convergence rate
- semidefinite programming
- support vector
- quadratic programming
- coefficient matrix
- special case
- column generation
- particle swarm optimization
- markov random field