Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints

DOI10.1137/19M1271750zbMATH Open1442.90154OpenAlexW3007620966MaRDI QIDQ5108481FDOQ5108481

Authors: Marc Teboulle, Yakov Vaisbourd 

Publication date: 4 May 2020

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

Full work available at URL: https://doi.org/10.1137/19m1271750

Recommendations

• Projected Gradient Methods for Nonnegative Matrix Factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
• Nonnegative matrix factorization with constrained second-order optimization
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint

zbMATH Keywords

global convergencenonnegative matrix factorizationsparsity constraintsnon-Euclidean Bregman distanceproximal gradient algorithmsessentially cyclic block proximal gradientKurdyka-łosiajewicz propertynonconvex nonsmooth composite minimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Convergence of a block coordinate descent method for nondifferentiable minimization
• Title not available (Why is that?)
• On the complexity of nonnegative matrix factorization
• Title not available (Why is that?)
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Non-negative matrix factorization with sparseness constraints
• Learning the parts of objects by non-negative matrix factorization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Title not available (Why is that?)
• On gradients of functions definable in o-minimal structures
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Fast nonnegative matrix factorization: an active-set-like method and comparisons
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Global convergence of modified multiplicative updates for nonnegative matrix factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Document clustering using nonnegative matrix factorization
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
• A Unified Convergence Analysis of the Multiplicative Update Algorithm for Regularized Nonnegative Matrix Factorization

Cited In (14)

• Block Bregman majorization minimization with extrapolation
• Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
• Modified accelerated Bregman projection methods for solving quasi-monotone variational inequalities
• Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
• Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization
• A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search.
• Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
• A discrete-time neurodynamic approach to sparsity-constrained nonnegative matrix factorization
• Global convergence of model function based Bregman proximal minimization algorithms
• Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization
• A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
• Matrix Optimization Problem Involving Group Sparsity and Nonnegativity Constraints

Uses Software

• CLUTO
• NeNMF

This page was built for publication: Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints

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