Subspace clustering by \((k,k)\)-sparse matrix factorization

DOI10.3934/ipi.2017025zbMath1407.68521OpenAlexW2609151092MaRDI QIDQ524727

Haixia Liu, Jian-Feng Cai, Yang Wang

Publication date: 3 May 2017

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/ipi.2017025

zbMATH Keywords

matrix factorizationlow-ranksubspace clustering(\(k,k\))-sparse\(k\)-support norm

Mathematics Subject Classification ID

Related Items (1)

A brief introduction to manifold optimization

Cites Work

• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• The convex geometry of linear inverse problems
• Hybrid linear modeling via local best-fit flats
• Generalized principal component analysis
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• On search directions for minimization algorithms

This page was built for publication: Subspace clustering by \((k,k)\)-sparse matrix factorization