Conic optimization-based algorithms for nonnegative matrix factorization

DOI10.1080/10556788.2023.2189714zbMath1528.90181arXiv2105.13646OpenAlexW4366823049MaRDI QIDQ6113533

Valentin Leplat, Nicolas Gillis, François Glineur, Yu. E. Nesterov

Publication date: 9 August 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

concave minimizationconic optimizationsecond-order conenonnegative matrix factorizationnonnegative rankexponential coneconvergence to stationary pointsFrank-Wolfe gap

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for exact nonnegative matrix factorization
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• Using underapproximations for sparse nonnegative matrix factorization
• A new dual based procedure for the transportation problem
• DC programming and DCA: thirty years of developments
• A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector
• Stability of propagation features under time-asymptotic approximations for a class of dispersive equations
• Computing a Nonnegative Matrix Factorization---Provably
• Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
• On the Complexity of Nonnegative Matrix Factorization
• On the combinatorial and algebraic complexity of quantifier elimination
• The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions
• Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
• An Almost Optimal Algorithm for Computing Nonnegative Rank

This page was built for publication: Conic optimization-based algorithms for nonnegative matrix factorization