scholarly journals Improving Network Slimming with Nonconvex Regularization

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Kevin Bui ◽  
Fredrick Park ◽  
Shuai Zhang ◽  
Yingyong Qi ◽  
Jack Xin
Author(s):  
Kevin Bui ◽  
Fredrick Park ◽  
Shuai Zhang ◽  
Yingyong Qi ◽  
Jack Xin

2017 ◽  
Vol 45 (6) ◽  
pp. 2455-2482 ◽  
Author(s):  
Po-Ling Loh ◽  
Martin J. Wainwright

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Zhijun Luo ◽  
Zhibin Zhu ◽  
Benxin Zhang

This paper proposes a nonconvex model (called LogTVSCAD) for deblurring images with impulsive noises, using the log-function penalty as the regularizer and adopting the smoothly clipped absolute deviation (SCAD) function as the data-fitting term. The proposed nonconvex model can effectively overcome the poor performance of the classical TVL1 model for high-level impulsive noise. A difference of convex functions algorithm (DCA) is proposed to solve the nonconvex model. For the model subproblem, we consider the alternating direction method of multipliers (ADMM) algorithm to solve it. The global convergence is discussed based on Kurdyka–Lojasiewicz. Experimental results show the advantages of the proposed nonconvex model over existing models.


2016 ◽  
Vol 54 (11) ◽  
pp. 6470-6480 ◽  
Author(s):  
Devis Tuia ◽  
Remi Flamary ◽  
Michel Barlaud

Sign in / Sign up

Export Citation Format

Share Document