1 October 2018 in Neural Networks
1 January 2012 in Journal of Mathematical Analysis and Applications
15 July 2019 in IEEE Transactions on Neural Networks and Learning Systems
In this paper, we study the minimization problem of a non-convex sparsity-promoting penalty function, i.e., fraction function, in compressed sensing. First, we discuss the equivalence of ℓ₀ minimization and fraction function minimization. It is proved that the optimal solution to fraction function minimization solves ℓ₀ minimization and the optimal solution to the regularization problem also solves fraction function minimization if the certain conditions are satisfied, which is similar to the regularization problem in a convex optimization theory. Second, we study the properties of the optimal solution to the regularization problem, including the first-order and second-order optimality conditions and the lower and upper bounds of the absolute value for its nonzero entries. Finally, we derive the closed-form representation of the optimal solution to the regularization problem and propose an iterative FP thresholding algorithm to solve the regularization problem. We also provide a series of experiments to assess the performance of the FP algorithm, and the experimental results show that the FP algorithm performs well in sparse signal recovery with and without measurement noise.
3 January 2017 in Mathematical Problems in Engineering
We introduce a preconditioning technique for the first‐order primal‐dual splitting method. The primal‐dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self‐adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.
3 November 2006 in Journal of Mathematical Analysis and Applications
5 October 2013 in Zeitschrift für angewandte Mathematik und Physik