Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm.
Michael J. ToddPublished in: Math. Oper. Res. (1988)
Keyphrases
- linear programming
- improved algorithm
- learning algorithm
- objective function
- optimal solution
- np hard
- dynamic programming
- optimization algorithm
- error bounds
- computational complexity
- preprocessing
- times faster
- k means
- detection algorithm
- high accuracy
- upper and lower bounds
- theoretical analysis
- computational cost
- worst case
- experimental evaluation
- search space
- neural network
- matching algorithm
- network flow
- average case
- simulated annealing
- randomized algorithm
- feasible solution
- monte carlo
- expectation maximization
- similarity measure
- genetic algorithm