A relative gradient algorithm for joint decompositions of complex matrices.
Tual TraininiXi-Lin LiEric MoreauTülay AdaliPublished in: EUSIPCO (2010)
Keyphrases
- computational cost
- learning algorithm
- computational complexity
- preprocessing
- dynamic programming
- times faster
- computationally efficient
- k means
- np hard
- computationally intensive
- improved algorithm
- recognition algorithm
- cost function
- worst case
- optimal solution
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- matrix multiplication
- iterative algorithms
- gradient vectors
- gradient information
- singular values
- singular value decomposition
- tree structure
- clustering method
- high accuracy
- search space
- search algorithm
- objective function
- multiscale