A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start".
Robert M. FreundPublished in: Math. Program. (1991)
Keyphrases
- approximation algorithms
- linear program
- quadratic program
- potential functions
- np hard
- linear programming problems
- simplex method
- primal dual
- semi infinite
- linear programming
- integer program
- linear relaxation
- optimal solution
- markov random field
- column generation
- lp relaxation
- mixed integer program
- approximate dynamic programming
- interior point methods
- lagrange multipliers
- maximum entropy
- dynamic programming
- simplex algorithm
- nonlinear programming
- stochastic programming
- convex optimization problems
- multiscale
- pairwise
- lower bound
- mixed integer
- knapsack problem
- mixed integer linear program
- random fields
- maximum likelihood
- objective function
- image processing