A novel class of variational models with nonconvex q -norm-type regularizations ( 0<q<1 ) is considered, which typically outperforms popular models with convex regularizations in restoring sparse images. Due to the fact that the objective function is nonconvex and non-Lipschitz, such models are very challenging from an analytical as well as numerical point of view. In this work a smoothing descent method with provable convergence properties is proposed for computing stationary points of the underlying variational problem. Numerical experiments are reported to illustrate the effectiveness of the new method
Total-variation (TV) regularization is widely adopted in image restoration problems to exploit the f...
We propose a new variational approach for the restoration of images simultaneously corrupted by blur...
Sparse modeling has been highly successful in many realworld applications. While a lot of interests ...
A nonconvex variational model is introduced which contains the q-"norm," q (0, 1), of the gradientof...
© 2015, Society for Industrial and Applied MathematicsRecently, nonconvex regularization models have...
In this paper, we propose a smoothing quadratic regularization (SQR) algorithm for solving a class o...
Abstract—Nonconvex nonsmooth regularization has advantages over convex regularization for restoring ...
Image restoration problems are often converted into large-scale, nonsmooth and non-convex optimizati...
Regularized minimization problems with nonconvex, nonsmooth, perhaps non-Lipschitz penalty functions...
The high-dimensional linear regression model has attracted much attention in areas like information ...
We propose a smoothing trust region filter algorithm for nonsmooth nonconvex least squares problems....
A popular strategy for determining solutions to linear least-squares problems relies on using sparsi...
Sparse modeling has been highly successful in many real-world applications. While a lot of interests...
Abstract. In this work we consider the regularization of vectorial data such as color images. Based ...
We study some properties of a nonconvex variational problem. We fail to attain the infimum of the fu...
Total-variation (TV) regularization is widely adopted in image restoration problems to exploit the f...
We propose a new variational approach for the restoration of images simultaneously corrupted by blur...
Sparse modeling has been highly successful in many realworld applications. While a lot of interests ...
A nonconvex variational model is introduced which contains the q-"norm," q (0, 1), of the gradientof...
© 2015, Society for Industrial and Applied MathematicsRecently, nonconvex regularization models have...
In this paper, we propose a smoothing quadratic regularization (SQR) algorithm for solving a class o...
Abstract—Nonconvex nonsmooth regularization has advantages over convex regularization for restoring ...
Image restoration problems are often converted into large-scale, nonsmooth and non-convex optimizati...
Regularized minimization problems with nonconvex, nonsmooth, perhaps non-Lipschitz penalty functions...
The high-dimensional linear regression model has attracted much attention in areas like information ...
We propose a smoothing trust region filter algorithm for nonsmooth nonconvex least squares problems....
A popular strategy for determining solutions to linear least-squares problems relies on using sparsi...
Sparse modeling has been highly successful in many real-world applications. While a lot of interests...
Abstract. In this work we consider the regularization of vectorial data such as color images. Based ...
We study some properties of a nonconvex variational problem. We fail to attain the infimum of the fu...
Total-variation (TV) regularization is widely adopted in image restoration problems to exploit the f...
We propose a new variational approach for the restoration of images simultaneously corrupted by blur...
Sparse modeling has been highly successful in many realworld applications. While a lot of interests ...