Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (Q4999395): Difference between revisions

Latest revision as of 08:36, 30 July 2024

scientific article; zbMATH DE number 7368848

Language	Label	Description	Also known as
English	Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms	scientific article; zbMATH DE number 7368848

Statements

instance of

scholarly article

0 references

title

Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms (English)

0 references

0 references

0 references

SIAM Journal on Mathematics of Data Science

0 references

publication date

6 July 2021

0 references

full work available at URL

https://arxiv.org/abs/2007.11446

0 references

zbMATH Keywords

simplex-structured matrix factorization

0 references

nonnegative matrix factorization

0 references

sparsity

0 references

identifiability

0 references

uniqueness

0 references

minimum volume

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Computing a nonnegative matrix factorization -- provably

0 references

Computing a Nonnegative Matrix Factorization---Provably

0 references

On handling indicator constraints in mixed integer programming

0 references

Primal-dual methods for vertex and facet enumeration

0 references

Identifiability of Complete Dictionary Learning

0 references

Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering

0 references

Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain

0 references

Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation

0 references

Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization

0 references

Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization

0 references

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization

0 references

Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition

0 references

Blind Audio Source Separation With Minimum-Volume Beta-Divergence NMF

0 references

A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing

0 references

Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization

0 references

Underdetermined Sparse Blind Source Separation of Nonnegative and Partially Overlapped Data

0 references

Generalized Low Rank Models

0 references

Lectures on Polytopes

0 references

Identifiers

DOI

10.1137/20M1354982

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4999395

@@ Property / describes a project that uses @@
+LowRankModels
@@ Property / describes a project that uses: LowRankModels / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Pyglrm
@@ Property / describes a project that uses: Pyglrm / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Computing a nonnegative matrix factorization -- provably
+Normal rank
@@ Property / cites work @@
+Computing a Nonnegative Matrix Factorization---Provably
+Normal rank
@@ Property / cites work @@
+On handling indicator constraints in mixed integer programming
+Normal rank
@@ Property / cites work @@
+Primal-dual methods for vertex and facet enumeration
+Normal rank
@@ Property / cites work @@
+Identifiability of Complete Dictionary Learning
@@ Property / cites work: Identifiability of Complete Dictionary Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
+Normal rank
@@ Property / cites work @@
+Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
+Normal rank
@@ Property / cites work @@
+Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
+Normal rank
@@ Property / cites work @@
+Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization
+Normal rank
@@ Property / cites work @@
+Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
+Normal rank
@@ Property / cites work @@
+Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
+Normal rank
@@ Property / cites work @@
+Blind Audio Source Separation With Minimum-Volume Beta-Divergence NMF
+Normal rank
@@ Property / cites work @@
+A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
+Normal rank
@@ Property / cites work @@
+Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
+Normal rank
@@ Property / cites work @@
+Underdetermined Sparse Blind Source Separation of Nonnegative and Partially Overlapped Data
+Normal rank
@@ Property / cites work @@
+Generalized Low Rank Models
@@ Property / cites work: Generalized Low Rank Models / rank @@
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3157795203
@@ Property / OpenAlex ID: W3157795203 / rank @@
+Normal rank