We study the minimization problem of a non-convex sparsity promoting penalty func- tion, the transformed l1 (TL1), and its application in compressed sensing (CS). The TL1 penalty inter- polates l0 and l1 norms through a nonnegative parameter a ∈ (0, +∞), similar to lp with p ∈ (0, 1], and is known to satisfy unbiasedness, sparsity and Lipschitz continuity properties. We first consider the constrained minimization problem, and discuss the exact recovery of l0 norm minimal solution based on the null space property (NSP). We then prove the stable recovery of l0 norm minimal solution if the sensing matrix A satisfies a restricted isometry property (RIP). We formulated a normalized problem to overcome the lack of scaling property of the TL1 penalty function. For a general sensing matrix A, we show that the support set of a local minimizer corresponds to linearly independent columns of A. Next, we present difference of convex algorithms for TL1 (DCATL1) in computing TL1-regularized con- strained and unconstrained problems in CS. The DCATL1 algorithm involves outer and inner loops of iterations, one time matrix inversion, repeated shrinkage operations and matrix-vector multiplications. The inner loop concerns an l1 minimization problem on which we employ the Alternating Direction Method of Multipliers (ADMM). For the unconstrained problem, we prove convergence of DCATL1 to a stationary point satisfying the first order optimality condition. In numerical experiments, we identify the optimal value a = 1, and compare DCATL1 with other CS algorithms on two classes of sensing ma- trices: Gaussian random matrices and over-sampled discrete cosine transform matrices (DCT). Among existing algorithms, the iterated reweighted least squares method based on l1/2 norm is the best in sparse recovery for Gaussian matrices, and the DCA algorithm based on l1 minus l2 penalty is the best for over-sampled DCT matrices. We find that for both classes of sensing matrices, the performance of DCATL1 algorithm (initiated with l1 minimization) always ranks near the top (if not the top), and is the most robust choice insensitive to the conditioning of the sensing matrix A. DCATL1 is also com- petitive in comparison with DCA on other non-convex penalty functions commonly used in statistics with two hyperparameters.

No abstract uploaded!

In this paper, we give a simultaneous vanishing principle for the $v$-adic Carlitz multiple polylogarithms (abbreviated as CMPLs) at algebraic points, where $v$ is a finite place of the rational function field over a finite field. This principle establishes the fact that the $v$-adic vanishing of CMPLs at algebraic points is equivalent to its $\infty$-adic counterpart being Eulerian. This reveals a nontrivial connection between the $v$-adic and $\infty$-adic worlds in positive characteristic.

No abstract uploaded!

We prove that intermediate Banach spaces $$\mathcal{A}$$ and $$\mathcal{B}$$ with respect to arbitrary Hilbert couples $$\bar {H}$$ and $$\bar {K}$$ are exact interpolation if and onlyif they are exact$K$-monotonic, i.e. the condition $$f^0 \in \mathcal{A}$$ and the inequality $$K(t,g^0 ;\bar {K}) \leqslant K(t,f^0 ;\bar {H}),t > 0$$ , imply$g$^{0}∈$B$and ‖$g$^{0}‖$B$≤‖$f$^{0}‖_{$A$}($K$is Peetre’s$K$-functional). It is well known that this property is implied by the following: for each ϱ>1 there exists an operator $$T:\bar {H} \to \bar {K}$$ such that$Tf$^{0}=$g$^{0}, and $$K(t,Tf;\bar {K}) \leqslant \rho K(t,f;\bar {H}),f \in \mathcal{H}_0 + \mathcal{H}_1 ,t > 0$$ . Verifying the latter property, it suffices to consider the “diagonal case” where $$\bar {H} = \bar {K}$$ is finite-dimensional, in which case we construct the relevant operators by a method which allows us to explicitly calculate them. In the strongest form of the theorem it is shown that the statement remains valid when substituting ϱ=1. The result leads to a short proof of Donoghue’s theorem on interpolation functions, as well as Löwner’s theorem on monotone matrix functions.