Related papers: When is P such that l_0-minimization Equals to l_p…
It is proved in this paper that to every underdetermined linear system $Ax=b$ there corresponds a constant $p(A,b)>0$ such that every solution to the $l_p$-norm minimization problem also solves the $l_0$-norm minimization problem whenever…
As a conclusion in classical linear algebra, an underdetermined linear equations usually have an infinite number of solutions. The sparest one among these solutions is significant in many applications. This problem can be modeled as the…
We consider the unconstrained $L_2$-$L_p$ minimization: find a minimizer of $\|Ax-b\|^2_2+\lambda \|x\|^p_p$ for given $A \in R^{m\times n}$, $b\in R^m$ and parameters $\lambda>0$, $p\in [0,1)$. This problem has been studied extensively in…
We consider a class of l0-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including lp-induced norm (0 < p < 1),…
The joint sparse recovery problem is a generalization of the single measurement vector problem which is widely studied in Compressed Sensing and it aims to recovery a set of jointly sparse vectors. i.e. have nonzero entries concentrated at…
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…
The literature on sparse recovery often adopts the $l_p$ "norm" $(p\in[0,1])$ as the penalty to induce sparsity of the signal satisfying an underdetermined linear system. The performance of the corresponding $l_p$ minimization problem can…
Necessary and sufficient conditions for the existence of solutions to the asymmetric $L_p$ Minkowski problem in $\mathbb{R}^2$ are established for $0 < p < 1$.
The dual $L_p$-Minkowski problem with $p<0<q$ is investigated in this paper. By proving a new existence result of solutions and constructing an example, we obtain the non-uniqueness of solutions to this problem.
Prior support constrained compressed sensing, achieved via the weighted norm minimization, has of late become popular due to its potential for applications. For the weighted norm minimization problem, $$ min \|x\|_{p,w} \text{ subject to }…
It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where…
Let $ n\geq 2, A=(a_{ij})_{i,j=1}^{n}$ be a real symmetric matrix, $a=(a_i)_{i=1}^{n}\in \Bbb R^n.$ Consider the differential operator $D_A = \sum_{i,j=1}^n a_{ij}{\partial^2 \over \partial x_i \partial x_j}+ \sum_{i=1}^n a_i{\partial \over…
In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…
Chou and Wang's existence result for the $L_p$-Minkowski problem on ${\mathbb S}^{n-1}$ for $p\in(-n,1)$ and an absolutely continuous measure $\mu$ is discussed and extended to more general measures. In particular, we provide an almost…
Many practical problems can be formulated as l0-minimization problems with nonnegativity constraints, which seek the sparsest nonnegative solutions to underdetermined linear systems. Recent study indicates that l1-minimization is efficient…
We prove the $C^0$ estimate for the $L_p$ $q$th dual Minkowski problem on $S^2$ under fairly general conditions; namely, when $p$ lies in [0,1) and $q>2+p$, and the $L_p$ $q$th dual curvarture is bounded and bounded away from zero. We note…
We prove that there is a unique $p_0\in [0,1)$, which can be characterized by the eigenvalue of Hilbert operator related to a convex body, that the even $L^p$ Minkowski problem has a unique solution for $p\geq p_0$, and the uniqueness fails…
Existence of solutions to the Lp Minkowski problem is proved for all p less than 0. For the cirtical case of p=-n, which is known as the centro-affine Minkowski problem, this paper contains the main result in [71] as a special case.
The composite L0 function serves as a sparse regularizer in many applications. The algorithmic difficulty caused by the composite L0 regularization (the L0 norm composed with a linear mapping) is usually bypassed through approximating the…
In this short note we prove the result stated in the title; that is, for every $p>0$ there exists an infinite dimensional closed linear subspace of $L_{p}[0,1]$ every nonzero element of which does not belong to $\bigcup\limits_{q>p}…