An Adaptive Newton-Picard Algorithm with Subspace Iteration for Computing Periodic Solutions.
Kurt LustDirk RoosePublished in: SIAM J. Sci. Comput. (1998)
Keyphrases
- optimal solution
- preprocessing
- dynamic programming
- learning algorithm
- cost function
- expectation maximization
- computational cost
- benchmark problems
- matching algorithm
- detection algorithm
- objective function
- similarity measure
- high dimensional
- data sets
- input data
- convergence rate
- times faster
- subspace clustering
- significant improvement
- solution quality
- feature selection
- image set
- clustering method
- segmentation algorithm
- computational complexity
- linear programming
- np hard
- search space