A Fast Iterative Algorithm for Near-Diagonal Eigenvalue Problems.
Maseim KenmoeRonald KriemannMatteo SmerlakAnton S. ZadorinPublished in: SIAM J. Matrix Anal. Appl. (2022)
Keyphrases
- computational complexity
- dynamic programming
- np hard
- learning algorithm
- k means
- cost function
- combinatorial optimization
- eigenvalue problems
- optimal solution
- particle swarm optimization
- segmentation algorithm
- detection algorithm
- optimization method
- feature space
- objective function
- machine learning
- input data
- expectation maximization
- convergence rate