Inertial Proximal Alternating Minimization Algorithm for a Class of Nonconvex and Nonsmooth Problems

2019 ◽  
Vol 08 (07) ◽  
pp. 1228-1238
Author(s):  
梦霞 陈
2016 ◽  
Vol 35 (2) ◽  
pp. 685-698 ◽  
Author(s):  
Yaqi Chen ◽  
Joseph A. O'Sullivan ◽  
David G. Politte ◽  
Joshua D. Evans ◽  
Dong Han ◽  
...  

Optik ◽  
2019 ◽  
Vol 185 ◽  
pp. 943-956 ◽  
Author(s):  
Qiaoling Shu ◽  
Chuansheng Wu ◽  
Qiuxiang Zhong ◽  
Ryan Wen Liu

2020 ◽  
Vol 28 (7) ◽  
pp. 1031-1056
Author(s):  
Anantachai Padcharoen ◽  
Duangkamon Kitkuan ◽  
Poom Kumam ◽  
Jewaidu Rilwan ◽  
Wiyada Kumam

2016 ◽  
Vol 2016 ◽  
pp. 1-7
Author(s):  
Xiaoya Zhang ◽  
Tao Sun ◽  
Lizhi Cheng

We deal with a class of problems whose objective functions are compositions of nonconvex nonsmooth functions, which has a wide range of applications in signal/image processing. We introduce a new auxiliary variable, and an efficient general proximal alternating minimization algorithm is proposed. This method solves a class of nonconvex nonsmooth problems through alternating minimization. We give a brilliant systematic analysis to guarantee the convergence of the algorithm. Simulation results and the comparison with two other existing algorithms for 1D total variation denoising validate the efficiency of the proposed approach. The algorithm does contribute to the analysis and applications of a wide class of nonconvex nonsmooth problems.


Sign in / Sign up

Export Citation Format

Share Document