Inertial proximal alternating minimization for nonconvex and nonsmooth problems

Inertial proximal alternating minimization for nonconvex and nonsmooth problems

Abstract In this paper, we study the minimization problem of the type L ( x , y ) = f ( x ) + R ( x , y ) + g ( y ) $L(x,y)=f(x)+R(x,y)+g(y)$ , where f and g are both nonconvex nonsmooth functions, and R is a smooth function we can choose. We present a proximal alternating minimization algorithm wit...

Full description

Bibliographic Details
Main Authors: Yaxuan Zhang, Songnian He
Format: Article
Language:English
Published: SpringerOpen 2017-09-01
Series:Journal of Inequalities and Applications
Subjects:
nonconvex nonsmooth optimization
proximal alternating minimization
inertial
Kurdyka-Lojasiewicz inequality
convergence
Online Access:http://link.springer.com/article/10.1186/s13660-017-1504-y

Internet

http://link.springer.com/article/10.1186/s13660-017-1504-y

Similar Items