On the Convergence of an Inexact Primal-Dual Interior Point Method for Linear Programming.
Venansius BaryamureebaTrond SteihaugPublished in: LSSC (2005)
Keyphrases
- primal dual
- linear programming
- interior point methods
- convergence rate
- linear program
- convex programming
- linear programming problems
- interior point algorithm
- interior point
- algorithm for linear programming
- semidefinite programming
- simplex algorithm
- variational inequalities
- simplex method
- inequality constraints
- feasible solution
- optimal solution
- quadratic programming
- objective function
- nonlinear programming
- column generation
- integer programming
- convex optimization
- valid inequalities
- global convergence
- np hard
- convex functions
- dynamic programming
- integer program
- semidefinite
- convergence analysis
- high resolution
- convex optimization problems
- analytic center
- pairwise
- image processing