A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
From MaRDI portal
Publication:1639712
DOI10.1007/s10589-018-0002-6zbMath1404.90126OpenAlexW2795293001MaRDI QIDQ1639712
Chong You, Daniel P. Robinson, Hao Jiang, René Victor Valqui Vidal
Publication date: 13 June 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-018-0002-6
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A geometric analysis of subspace clustering with outliers
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Robust subspace clustering
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Generalized principal component analysis
- Nonsmooth analysis of singular values. I: Theory
- Operator-Lipschitz estimates for the singular value functional calculus
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- Robust principal component analysis?
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Trust Region Methods
- Relations Among Some Low-Rank Subspace Recovery Models
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
