A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
From MaRDI portal
(Redirected from Publication:1639712)
Recommendations
- An accelerated gradient method for nonconvex sparse subspace clustering problem
- Global convergence of ADMM in nonconvex nonsmooth optimization
- An alternating direction method with continuation for nonconvex low rank minimization
- Fast, robust and non-convex subspace recovery
- Robust subspace segmentation via nonconvex low rank representation
Cites work
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- 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
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Generalized principal component analysis
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Nonsmooth analysis of singular values. I: Theory
- Operator-Lipschitz estimates for the singular value functional calculus
- Relations among some low-rank subspace recovery models
- Robust principal component analysis?
- Robust subspace clustering
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Trust Region Methods
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
Cited in
(8)- Exploiting negative curvature in deterministic and stochastic optimization
- Finding the largest low-rank clusters with Ky Fan \(2\)-\(k\)-norm and \(\ell_1\)-norm
- A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
- Mechanism and a new algorithm for nonconvex clustering
- An accelerated gradient method for nonconvex sparse subspace clustering problem
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Nonnegative self-representation with a fixed rank constraint for subspace clustering
- Multiview clustering of images with tensor rank minimization via nonconvex approach
This page was built for publication: A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639712)
