Parameter α versus number of iterations in Karmarkar's algorithm for LP.
Syamal K. SenJuan F. AvilaPublished in: Neural Parallel Sci. Comput. (2010)
Keyphrases
- computational complexity
- execution times
- optimal solution
- memory requirements
- preprocessing
- cost function
- dynamic programming
- experimental evaluation
- learning algorithm
- parameter tuning
- detection algorithm
- linear programming
- computational cost
- np hard
- objective function
- k means
- primal dual
- high accuracy
- neural network
- optimization algorithm
- similarity measure
- computational effort
- space complexity
- number of iterations required
- cluster centers
- knapsack problem
- convex hull
- matching algorithm
- particle swarm optimization
- small number