On the choice of parameters for power-series interior point algorithms in linear programming.
Gongyun ZhaoPublished in: Math. Program. (1995)
Keyphrases
- interior point
- linear programming
- linear program
- interior point methods
- primal dual
- semidefinite programming
- convex optimization
- linear programming problems
- simplex algorithm
- np hard
- nonnegative matrix factorization
- semidefinite
- feasible solution
- lp relaxation
- optimal solution
- computationally intensive
- quadratic programming
- dynamic programming
- simplex method
- learning algorithm
- objective function