Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization (Q4689774): Difference between revisions

Latest revision as of 17:43, 14 September 2024

scientific article; zbMATH DE number 6957877

Language	Label	Description	Also known as
English	Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization	scientific article; zbMATH DE number 6957877

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Imaging Sciences

0 references

publication date

17 October 2018

0 references

full work available at URL

https://arxiv.org/abs/1708.02883

0 references

zbMATH Keywords

maximum volume inscribed ellipsoid

0 references

simplex

0 references

structured matrix factorization

0 references

facet enumeration

0 references

convex optimization

0 references

describes a project that uses

USGS Spectral Library

0 references

Qhull

0 references

CVX

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Computing a nonnegative matrix factorization -- provably

0 references

How good are convex hull algorithms?

0 references

The quickhull algorithm for convex hulls

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Q3622253

0 references

Q4821526

0 references

Primal-dual methods for vertex and facet enumeration

0 references

A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing

0 references

A Convex Analysis Framework for Blind Separation of Non-Negative Sources

0 references

Q2747613

0 references

A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space

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

Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices

0 references

Q5173028

0 references

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

0 references

On the complexity of some basic problems in computational convexity. I. Containment problems

0 references

An arithmetic proof of John's ellipsoid theorem

0 references

Q4051879

0 references

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

0 references

Q3079670

0 references

\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes

0 references

Computation of Minimum-Volume Covering Ellipsoids

0 references

Identifiers

zbMATH Open document ID

1441.94019

0 references

DOI

10.1137/17M114145X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4689774

@@ Property / cites work @@
+Computing a nonnegative matrix factorization -- provably
+Normal rank
@@ Property / cites work @@
+How good are convex hull algorithms?
@@ Property / cites work: How good are convex hull algorithms? / rank @@
+Normal rank
@@ Property / cites work @@
+The quickhull algorithm for convex hulls
@@ Property / cites work: The quickhull algorithm for convex hulls / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
+Normal rank
@@ Property / cites work @@
+Q3622253
@@ Property / cites work: Q3622253 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual methods for vertex and facet enumeration
+Normal rank
@@ Property / cites work @@
+A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
+Normal rank
@@ Property / cites work @@
+A Convex Analysis Framework for Blind Separation of Non-Negative Sources
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
+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 @@
+Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
+Normal rank
@@ Property / cites work @@
+Q5173028
@@ Property / cites work: Q5173028 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
+Normal rank
@@ Property / cites work @@
+On the complexity of some basic problems in computational convexity. I. Containment problems
+Normal rank
@@ Property / cites work @@
+An arithmetic proof of John's ellipsoid theorem
@@ Property / cites work: An arithmetic proof of John's ellipsoid theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4051879
@@ Property / cites work: Q4051879 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
+Normal rank
@@ Property / cites work @@
+Q3079670
@@ Property / cites work: Q3079670 / rank @@
+Normal rank
@@ Property / cites work @@
+\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
+Normal rank
@@ Property / cites work @@
+Computation of Minimum-Volume Covering Ellipsoids
@@ Property / cites work: Computation of Minimum-Volume Covering Ellipsoids / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129630161
@@ Property / Wikidata QID: Q129630161 / rank @@
+Normal rank