Block Bregman Majorization Minimization with Extrapolation
DOI10.1137/21M1432661zbMath1486.90154arXiv2107.04395OpenAlexW4205214044MaRDI QIDQ5037560
Le Thi Khanh Hien, Masoud Ahookhosh, Nicolas Gillis, Panagiotis Patrinos, Duy Nhat Phan
Publication date: 1 March 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.04395
orthogonal nonnegative matrix factorizationmajorization minimizationacceleration by extrapolationinertial block coordinate methodBregman surrogate function
Factorization of matrices (15A23) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Matrix completion problems (15A83)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A fast patch-dictionary method for whole image recovery
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Lectures on convex optimization
- Iterative hard thresholding for compressed sensing
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A coordinate gradient descent method for nonsmooth separable minimization
- On gradients of functions definable in o-minimal structures
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- 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
- 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
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- Sparse Approximate Solutions to Linear Systems
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization
- Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints
- Nonnegative Matrix Factorization
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
- On the Convergence of Block Coordinate Descent Type Methods
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
This page was built for publication: Block Bregman Majorization Minimization with Extrapolation
