A QMR-based interior-point algorithm for solving linear programs.
Roland W. FreundFlorian JarrePublished in: Math. Program. (1996)
Keyphrases
- interior point algorithm
- linear program
- linear programming
- simplex method
- primal dual
- interior point methods
- linear programming problems
- semi infinite
- column generation
- np hard
- dynamic programming
- interior point
- simplex algorithm
- feasible solution
- quadratic programming
- optimal solution
- quadratic program
- stochastic programming
- objective function
- reinforcement learning
- mixed integer linear program
- strongly polynomial
- integer program
- convex optimization
- convergence rate
- mixed integer
- integer programming
- linear inequalities
- extreme points
- image denoising
- search algorithm
- bayesian networks