Pages that link to "Item:Q5108481"

The following pages link to Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints (Q5108481):

Displaying 10 items.

• Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (Q490274) (← links)
• Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence (Q2031873) (← links)
• Global convergence of model function based Bregman proximal minimization algorithms (Q2154449) (← links)
• A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search. (Q2444509) (← links)
• A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary (Q4616947) (← links)
• Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity (Q6078423) (← links)
• Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems (Q6145059) (← links)
• Modified accelerated Bregman projection methods for solving quasi-monotone variational inequalities (Q6565285) (← links)
• Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization (Q6574508) (← links)