An Asymptotical O(√(n) L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods.
Pi-Fang HungYinyu YePublished in: SIAM J. Optim. (1996)
Keyphrases
- linear programming
- objective function
- optimal solution
- learning algorithm
- experimental evaluation
- computational cost
- improved algorithm
- np hard
- dynamic programming
- high accuracy
- cost function
- worst case
- segmentation algorithm
- semidefinite programming
- preprocessing
- search algorithm
- expectation maximization
- theoretical analysis
- optimization algorithm
- detection algorithm
- energy function
- obstacle avoidance
- neural network
- times faster
- path planning
- matching algorithm
- ant colony optimization
- clustering method
- particle swarm optimization
- computational complexity