An accelerated alternating partial Bregman algorithm for ReLU-based matrix decomposition

DOI10.1007/S10915-025-03067-WMaRDI QIDQ6897806zbMATH OpenFDO

Authors Yunfei Qu, Chunfeng Cui, Deren Han

Publication date 19 November 2025

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10915-025-03067-W

zbMATH Keywords

accelerationalternating minimizationBregman methodlow-rankReLU activation function

Mathematics Subject Classification ID

Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Mathematical programming (90Cxx)

Cites work

• A customized inertial proximal alternating minimization for SVD-free robust principal component analysis
• A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems
• A nonlinear matrix decomposition for mining the zeros of sparse data
• Block Bregman majorization minimization with extrapolation
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
• Document clustering using nonnegative matrix factorization
• First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
• First-order methods in optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 7626710 (Why is no real title available?)
• scientific article; zbMATH DE number 3296905 (Why is no real title available?)
• Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Learning the parts of objects by non-negative matrix factorization
• Lectures on convex optimization
• Majorization-minimization for sparse nonnegative matrix factorization with the -divergence
• Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
• Nearly unbiased variable selection under minimax concave penalty
• Neighborhood structure assisted non-negative matrix factorization and its application in unsupervised point-wise anomaly detection
• Nonnegative matrix factorization
• Pattern recognition and machine learning.
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Tensor Decompositions and Applications
• The approximation of one matrix by another of lower rank.
• Tikhonov Regularization and Total Least Squares
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Variational Analysis

Cited in

(2)

• An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
• ReLU-based nonlinear tensor decomposition for sparse nonnegative data

This page was built for publication: An accelerated alternating partial Bregman algorithm for ReLU-based matrix decomposition

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