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

DOI10.1137/17M114145XzbMath1441.94019arXiv1708.02883WikidataQ129630161 ScholiaQ129630161MaRDI QIDQ4689774

Wing-Kin Ma, Chia-Hsiang Lin, Chong-Yung Chi, Yue Wang, Ruiyuan Wu

Publication date: 17 October 2018

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.02883

zbMATH Keywords

convex optimizationsimplexfacet enumerationstructured matrix factorizationmaximum volume inscribed ellipsoid

Mathematics Subject Classification ID

Factorization of matrices (15A23) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (2)

Smoothed separable nonnegative matrix factorization ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms

Uses Software

• Qhull
• CVX
• USGS Spectral Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Primal-dual methods for vertex and facet enumeration
• On the complexity of some basic problems in computational convexity. I. Containment problems
• How good are convex hull algorithms?
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes
• An arithmetic proof of John's ellipsoid theorem
• Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
• The quickhull algorithm for convex hulls
• A Convex Analysis Framework for Blind Separation of Non-Negative Sources
• A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
• Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
• Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
• Computation of Minimum-Volume Covering Ellipsoids
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• Computing a nonnegative matrix factorization -- provably

This page was built for publication: Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization