Approximate low-rank factorization with structured factors |
| |
Authors: | Ivan Markovsky Mahesan Niranjan |
| |
Affiliation: | School of Electronics and Computer Science, University of Southampton, Southampton, SO17 1BJ, UK |
| |
Abstract: | An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in microarray data analysis, are sparsity, nonnegativity, periodicity, and smoothness. In general, the approximate rank revealing factorization problem is nonconvex. An alternating projections algorithm is developed, which is globally convergent to a locally optimal solution. Although the algorithm is developed for a specific application in microarray data analysis, the approach is applicable to other types of structures. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|