Efficient algorithms for regularized nonnegative scale-invariant low-rank approximation models

DOI10.1137/24M1657948MaRDI QIDQ6993650zbMATH OpenFDO

Authors Jeremy Cohen, Valentin Leplat

Publication date 25 April 2025

Published in SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1657948

zbMATH Keywords

constrained low-rank approximationsnonconvex optimizationsparse approximation

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical linear algebra (65F99) Numerical optimization and variational techniques (65K10)

Cites work

• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• A unifying representer theorem for inverse problems and machine learning
• Algorithms for nonnegative matrix factorization with the -divergence
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
• Algorithms for Sparse Nonnegative Tucker Decompositions
• An AO-ADMM Approach to Constraining PARAFAC2 on All Modes
• Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
• Global convergence of modified multiplicative updates for nonnegative matrix factorization
• Independent Component Analysis and Blind Signal Separation
• Learning the parts of objects by non-negative matrix factorization
• Least angle regression. (With discussion)
• Local convergence of the alternating least squares algorithm for canonical tensor approximation
• Majorization-minimization for sparse nonnegative matrix factorization with the -divergence
• Model Selection and Estimation in Regression with Grouped Variables
• Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
• Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
• On representer theorems and convex regularization
• Optimization with sparsity-inducing penalties
• Regression Shrinkage and Selection via The Lasso: A Retrospective
• Robust and efficient estimation by minimising a density power divergence
• SLOPE-adaptive variable selection via convex optimization
• Tensor Decompositions and Applications
• The dynamics of swamps in the canonical tensor approximation problem
• The Lasso problem and uniqueness
• Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics

This page was built for publication: Efficient algorithms for regularized nonnegative scale-invariant low-rank approximation models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993650)