A relaxed gradient based algorithm for solving generalized coupled Sylvester matrix equations.
Xingping ShengPublished in: J. Frankl. Inst. (2018)
Keyphrases
- learning algorithm
- preprocessing
- mathematical model
- cost function
- np hard
- dynamic programming
- optimal solution
- algebraic equations
- objective function
- combinatorial optimization
- significant improvement
- detection algorithm
- worst case
- similarity measure
- square root
- convergence rate
- least squares
- computational cost
- search space
- particle swarm optimization
- segmentation algorithm
- k means
- association rules
- computational complexity
- gradient projection