Pages that link to "Item:Q2044495"
From MaRDI portal
The following pages link to Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495):
Displaying 10 items.
- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization (Q490274) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- Block Bregman Majorization Minimization with Extrapolation (Q5037560) (← links)
- (Q5095420) (← links)
- The convergence properties of infeasible inexact proximal alternating linearized minimization (Q6074854) (← links)
- An alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variant (Q6166106) (← links)
- Random Coordinate Descent Methods for Nonseparable Composite Optimization (Q6176428) (← links)
- A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis (Q6497038) (← links)
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints (Q6593830) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
