Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's.
John R. BirgeAkli GanaPublished in: Math. Program. (1983)
Keyphrases
- computational complexity
- computational cost
- cost function
- high accuracy
- experimental evaluation
- improved algorithm
- objective function
- detection method
- numerical examples
- computationally efficient
- preprocessing
- k means
- high efficiency
- detection algorithm
- optimization algorithm
- recognition algorithm
- dynamic programming
- computational efficiency
- matching algorithm
- significant improvement
- clustering method
- interior point algorithm
- selection algorithm
- computational load
- quadratic programming
- high computational complexity
- segmentation algorithm
- input data
- similarity measure
- theoretical analysis
- synthetic and real images
- estimation algorithm
- segmentation method
- np hard
- worst case
- algebraic equations
- support vector machine svm
- combinatorial optimization
- classification algorithm
- simplex method
- classification method
- tree structure
- reconstruction method
- exhaustive search
- implicit enumeration
- optimal solution
- lower bound
- learning algorithm
- motion estimation
- convergence rate
- optimization method
- linear programming
- np complete
- search space
- evolutionary algorithm
- energy function