On weak tractability of the Smolyak algorithm for approximation problems.
Guiqiao XuPublished in: J. Approx. Theory (2015)
Keyphrases
- computational complexity
- improved algorithm
- benchmark problems
- dynamic programming
- detection algorithm
- objective function
- preprocessing
- np hard
- times faster
- computational cost
- computationally efficient
- optimal or near optimal
- recognition algorithm
- clustering method
- matching algorithm
- learning algorithm
- linear systems
- test problems
- search space
- error bounds
- k means
- significant improvement
- experimental evaluation
- optimization problems
- optimization algorithm
- segmentation algorithm
- monte carlo
- worst case
- theoretical analysis
- combinatorial optimization
- probabilistic model
- np complete
- association rules
- similarity measure
- randomly generated
- expectation maximization
- iterative algorithms
- simulated annealing