Related papers: Injectivity and weak*-to-weak continuity suffice f…

In the context of sparse recovery, it is known that most of existing regularizers such as $\ell_1$ suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class…

We show that any weak solution to elliptic equations in divergence form is continuously differentiable provided that the modulus of continuity of coefficients in the $L^1$-mean sense satisfies the Dini condition. This in particular answers…

In this paper, we study the averaging principle for a class of stochastic differential equations driven by $\alpha$-stable processes with slow and fast time-scales, where $\alpha\in(1,2)$. We prove that the strong and weak convergence order…

This paper gives necessary and sufficient conditions for the convergence of the solution of a weakly damped second order linear differential equation that is subjected to outside forcing, for which solutions of the unforced equation are…

We study the application of the Augmented Lagrangian Method to the solution of linear ill-posed problems. Previously, linear convergence rates with respect to the Bregman distance have been derived under the classical assumption of a…

The constrained $\ell_0$ regularization plays an important role in sparse reconstruction. A widely used approach for solving this problem is the penalty method, of which the least square penalty problem is a special case. However, the…

There has been considerable advance in understanding the properties of sparse regularization procedures in high-dimensional models. In time series context, it is mostly restricted to Gaussian autoregressions or mixing sequences. We study…

Recently, finding the sparsest solution of an underdetermined linear system has become an important request in many areas such as compressed sensing, image processing, statistical learning, and data sparse approximation. In this paper, we…

Analysis sparsity is a common prior in inverse problem or machine learning including special cases such as Total Variation regularization, Edge Lasso and Fused Lasso. We study the geometry of the solution set (a polyhedron) of the analysis…

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

Convergence rates in spectral regularization methods quantify the approximation error in inverse problems as a function of the noise level or the number of sampling points. Classical strong convergence rate results typically rely on source…

The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…

We consider the regularized short-pulse equation, which contains nonlinear dis- persive effects. We prove that as the diffusion parameter tends to zero, the solutions of the dispersive equation converge to discontinuous weak solutions of…

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

This paper provides a new regularization method which is particularly suitable for linear exponentially ill-posed problems. Under logarithmic source conditions (which have a natural interpretation in terms of Sobolev spaces in the…

We study an elliptic operator $L:=\mathrm{div}(A\nabla \cdot)$ on the upper half space. It is known that solvability of the Regularity problem in $\dot{W}^{1,p}$ implies solvability of the adjoint Dirichlet problem in $L^{p'}$. Previously,…

Sparsity and rank functions are important ways of regularizing under-determined linear systems. Optimization of the resulting formulations is made difficult since both these penalties are non-convex and discontinuous. The most common remedy…

Statistical and machine learning theory has developed several conditions ensuring that popular estimators such as the Lasso or the Dantzig selector perform well in high-dimensional sparse regression, including the restricted eigenvalue,…

Measuring the error by an l^1-norm, we analyze under sparsity assumptions an l^0-regularization approach, where the penalty in the Tikhonov functional is complemented by a general stabilizing convex functional. In this context, ill-posed…

This paper follows the recent discussion on the sparse solution recovery with quasi-norms $\ell_q,~q\in(0,1)$ when the sensing matrix possesses a Restricted Isometry Constant $\delta_{2k}$ (RIC). Our key tool is an improvement on a version…