A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems

03/09/2020
by   Masoud Ahookhosh, et al.
0

In this paper, a block inertial Bregman proximal algorithm, namely [], for solving structured nonsmooth nonconvex optimization problems is introduced. More specifically, the objective function is the sum of a block relatively smooth function (i.e., relatively smooth with respect to each block) and block separable (nonsmooth) nonconvex functions. It is shown that the sequence generated by [] converges subsequentially to critical points, while it is globally convergent for Kurdyka-Łojasiewicz (KŁ) functions. Furthermore, the rate of convergence of this sequence is studied for the Łojasiewicz-type KŁ functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
02/15/2023

An abstract convergence framework with application to inertial inexact forward–backward methods

In this paper we introduce a novel abstract descent scheme suited for th...
research
10/17/2018

A Proximal Zeroth-Order Algorithm for Nonconvex Nonsmooth Problems

In this paper, we focus on solving an important class of nonconvex optim...
research
05/05/2020

Inertial Stochastic PALM and its Application for Learning Student-t Mixture Models

Inertial algorithms for minimizing nonsmooth and nonconvex functions as ...
research
09/12/2017

A convergence frame for inexact nonconvex and nonsmooth algorithms and its applications to several iterations

In this paper, we consider the convergence of an abstract inexact noncon...
research
10/23/2020

An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization

In this paper, we introduce TITAN, a novel inerTial block majorIzation m...

Please sign up or login with your details

Forgot password? Click here to reset