First-order optimality condition of basis pursuit denoise problem

A new first-order optimality condition for the basis pursuit denoise （BPDN） problem is derived. This condition provides a new approach to choose the penalty param- eters adaptively for a fixed point iteration algorithm. Meanwhile, the result is extended to matrix completion which is a new field on the heel of the compressed sensing. The numerical experiments of sparse vector recovery and low-rank matrix completion show validity of the theoretic results.

A Fixed Point Iterative Algorithm for Concave Penalized Linear Regression Model

This paper concerns computational problems of the concave penalized linear regression model.We propose a fixed point iterative algorithm to solve the computational problem based on the fact that the penalized estimator satisfies a fixed point equation.The convergence property of the proposed algorithm is established.Numerical studies are conducted to evaluate the finite sample performance of the proposed algorithm.

High Order Finite Difference Hermite WENO Fixed-Point Fast Sweeping Method for Static Hamilton-Jacobi Equations

In this paper, we combine the nonlinear HWENO reconstruction in [43] andthe fixed-point iteration with Gauss-Seidel fast sweeping strategy, to solve the staticHamilton-Jacobi equations in a novel HWENO framework recently developed in [22].The proposed HWENO frameworks enjoys several advantages. First, compared withthe traditional HWENO framework, the proposed methods do not need to introduceadditional auxiliary equations to update the derivatives of the unknown function φ.They are now computed from the current value of φ and the previous spatial derivatives of φ. This approach saves the computational storage and CPU time, which greatlyimproves the computational efficiency of the traditional HWENO scheme. In addition,compared with the traditional WENO method, reconstruction stencil of the HWENOmethods becomes more compact, their boundary treatment is simpler, and the numerical errors are smaller on the same mesh. Second, the fixed-point fast sweeping methodis used to update the numerical approximation. It is an explicit method and doesnot involve the inverse operation of nonlinear Hamiltonian, therefore any HamiltonJacobi equations with complex Hamiltonian can be solved easily. It also resolves someknown issues, including that the iterative number is very sensitive to the parameterε used in the nonlinear weights, as observed in previous studies. Finally, to furtherreduce the computational cost, a hybrid strategy is also presented. Extensive numerical experiments are performed on two-dimensional problems, which demonstrate thegood performance of the proposed fixed-point fast sweeping HWENO methods.

A non-local vectorial total variational model for multichannel SAR image speckle suppression

Abstract This paper aims at the multichannel synthetic aperture radar （SAR） image speckle reduc- tion. This paper proposes a novel energy minimized regularization model for multichannel image denoising, which is an extension of the non-local total variational model for gray-scale image. It contains two terms, namely the vectorial data fidelity term and the non-local vectorial total variation term. The latter is constructed by high-dimensional non-local gradient that contains the structure information of the multichannel image. The existence and the uniqueness of the solution of the model are proved. A fixed point iterative algorithm is designed to acquire the solution of this model. The convergence property of this algorithm is proved as well. This model is applied to the multipolarimetric and multi-temporal RAI）ARSAT-2 images despeckling. The result shows that this model performs better than the original vectorial total variational model on texture preserving.