Block Alternating Bregman Majorization Minimization with Extrapolation

07/09/2021
by   Le Thi Khanh Hien, et al.
0

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 L-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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2019

Provable Bregman-divergence based Methods for Nonconvex and Non-Lipschitz Problems

The (global) Lipschitz smoothness condition is crucial in establishing t...
research
05/11/2023

Stochastic Variance-Reduced Majorization-Minimization Algorithms

We study a class of nonconvex nonsmooth optimization problems in which t...
research
09/01/2016

Understanding Trainable Sparse Coding via Matrix Factorization

Sparse coding is a core building block in many data analysis and machine...
research
06/02/2017

Understanding the Learned Iterative Soft Thresholding Algorithm with matrix factorization

Sparse coding is a core building block in many data analysis and machine...
research
08/23/2023

An Accelerated Block Proximal Framework with Adaptive Momentum for Nonconvex and Nonsmooth Optimization

We propose an accelerated block proximal linear framework with adaptive ...
research
10/16/2017

A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems

We consider a class of nonconvex nonsmooth optimization problems whose o...

Please sign up or login with your details

Forgot password? Click here to reset