Dual simplex volume maximization for simplex-structured matrix factorization
From MaRDI portal
Cites work
- A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
- A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
- Computing a nonnegative matrix factorization -- provably
- Exact and heuristic algorithms for semi-nonnegative matrix factorization
- Generalized low rank models
- Learning the parts of objects by non-negative matrix factorization
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
- On the complexity of robust PCA and \(\ell_1\)-norm low-rank matrix approximation
- Polytopic matrix factorization: determinant maximization based criterion and identifiability
- Robust principal component analysis?
- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Successive nonnegative projection algorithm for robust nonnegative blind source separation
This page was built for publication: Dual simplex volume maximization for simplex-structured matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027309)
