Block Bregman majorization minimization with extrapolation
From MaRDI portal
Abstract: In this paper, we consider a class of nonsmooth nonconvex optimization problems whose objective is the sum of a block relative smooth function and a proper and lower semicontinuous block separable function. Although the analysis of block proximal gradient (BPG) methods for the class of block -smooth functions have been successfully extended to Bregman BPG methods that deal with the class of block relative smooth functions, accelerated Bregman BPG methods are scarce and challenging to design. Taking our inspiration from Nesterov-type acceleration and the majorization-minimization scheme, we propose a block alternating Bregman Majorization-Minimization framework with Extrapolation (BMME). We prove subsequential convergence of BMME to a first-order stationary point under mild assumptions, and study its global convergence under stronger conditions. We illustrate the effectiveness of BMME on the penalized orthogonal nonnegative matrix factorization problem.
Recommendations
- Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A coordinate gradient descent method for nonsmooth separable minimization
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A fast patch-dictionary method for whole image recovery
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- 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
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Iterative hard thresholding for compressed sensing
- Lectures on convex optimization
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Nonnegative matrix factorization
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- On gradients of functions definable in o-minimal structures
- On the convergence of block coordinate descent type methods
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- 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
- Relatively smooth convex optimization by first-order methods, and applications
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Sparse Approximate Solutions to Linear Systems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
Cited in
(14)- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- Coordinate descent methods beyond smoothness and separability
- Convergence analysis of block majorize-minimize subspace approach
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Stochastic variance-reduced majorization-minimization algorithms
- Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
- Sequential sample average majorization-minimization
- An accelerated alternating partial Bregman algorithm for ReLU-based matrix decomposition
- A fast computational Gauss-Seidel type iPALM algorithm using an incremental aggregated gradient strategy for weakly convex composite optimization problems with application in image processing
- Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization
- Global convergence of block Bregman proximal iteratively reweighted algorithm with extrapolation
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Data-driven methods for quantitative imaging
This page was built for publication: Block Bregman majorization minimization with extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037560)
