A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization

DOI10.1137/21M145313XMaRDI QIDQ5057774

Zheng-Jian Bai, Wai-Ki Ching, Guiyun Xiao

Publication date: 19 December 2022

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

sparsitynonnegative matrix factorizationalternating minimizationproximal gradient methodstochastic matrix factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical mathematical programming methods (65K05) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Unnamed Item
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Algorithm for cardinality-constrained quadratic optimization
• Modeling default data via an interactive hidden Markov model
• On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
• Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Efficient projected gradient methods for cardinality constrained optimization
• An augmented Lagrangian method for cardinality-constrained optimization problems
• Structural properties of affine sparsity constraints
• An efficient optimization approach for a cardinality-constrained index tracking problem
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Variational Analysis
• First-Order Methods in Optimization
• Learning the parts of objects by non-negative matrix factorization
• Interactive hidden Markov models and their applications
• Unsupervised learning by probabilistic latent semantic analysis
• Sparse Topic Modeling: Computational Efficiency, Near-Optimal Algorithms, and Statistical Inference

This page was built for publication: A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization