首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 390 毫秒
1.
In this paper, we focus on the \(\ell _1-\ell _p\) minimization problem with \(0<p<1\), which is challenging due to the \(\ell _p\) norm being non-Lipschizian. In theory, we derive computable lower bounds for nonzero entries of the generalized first-order stationary points of \(\ell _1-\ell _p\) minimization, and hence of its local minimizers. In algorithms, based on three locally Lipschitz continuous \(\epsilon \)-approximation to \(\ell _p\) norm, we design several iterative reweighted \(\ell _1\) and \(\ell _2\) methods to solve those approximation problems. Furthermore, we show that any accumulation point of the sequence generated by these methods is a generalized first-order stationary point of \(\ell _1-\ell _p\) minimization. This result, in particular, applies to the iterative reweighted \(\ell _1\) methods based on the new Lipschitz continuous \(\epsilon \)-approximation introduced by Lu (Math Program 147(1–2):277–307, 2014), provided that the approximation parameter \(\epsilon \) is below a threshold value. Numerical results are also reported to demonstrate the efficiency of the proposed methods.  相似文献   

2.
We prove some sharp \(L^p-L^2\) estimates for joint spectral projections \(\pi _{\ell \ell '}\), with \(\ell ,\ell '\in {\mathbb {N}}\), \(\ell \ge \ell '\ge 0\), \(1\le p\le 2\), associated to the Laplace–Beltrami operator and to a suitably defined subLaplacian on the unit quaternionic sphere.  相似文献   

3.
We compute the \({\mathbb {Z}}\)-rank of the subgroup \(\widetilde{E}_K =\bigcap _{n\in {\mathbb {N}}} N_{K_n/K}(K_n^\times )\) of elements of the multiplicative group of a number field K that are norms from every finite level of the cyclotomic \({\mathbb {Z}}_\ell \)-extension \(K^c\) of K. Thus we compare its \(\ell \)-adification \({\mathbb {Z}}_\ell \otimes _{\mathbb {Z}}\widetilde{E}_K\) with the group of logarithmic units \(\widetilde{\varepsilon }_K\). By the way we point out an easy proof of the Gross–Kuz’min conjecture for \(\ell \)-undecomposed extensions of abelian fields.  相似文献   

4.
We present a second order algorithm, based on orthantwise directions, for solving optimization problems involving the sparsity enhancing \(\ell _1\)-norm. The main idea of our method consists in modifying the descent orthantwise directions by using second order information both of the regular term and (in weak sense) of the \(\ell _1\)-norm. The weak second order information behind the \(\ell _1\)-term is incorporated via a partial Huber regularization. One of the main features of our algorithm consists in a faster identification of the active set. We also prove that a reduced version of our method is equivalent to a semismooth Newton algorithm applied to the optimality condition, under a specific choice of the algorithm parameters. We present several computational experiments to show the efficiency of our approach compared to other state-of-the-art algorithms.  相似文献   

5.
We consider the positive solutions of the nonlinear eigenvalue problem \(-\Delta _{\mathbb {H}^n} u = \lambda u + u^p, \) with \(p=\frac{n+2}{n-2}\) and \(u \in H_0^1(\Omega ),\) where \(\Omega \) is a geodesic ball of radius \(\theta _1\) on \(\mathbb {H}^n.\) For radial solutions, this equation can be written as an ordinary differential equation having n as a parameter. In this setting, the problem can be extended to consider real values of n. We show that if \(2<n<4\) this problem has a unique positive solution if and only if \(\lambda \in \left( n(n-2)/4 +L^*\,,\, \lambda _1\right) .\) Here \(L^*\) is the first positive value of \(L = -\ell (\ell +1)\) for which a suitably defined associated Legendre function \(P_{\ell }^{-\alpha }(\cosh \theta ) >0\) if \(0 < \theta <\theta _1\) and \(P_{\ell }^{-\alpha }(\cosh \theta _1)=0,\) with \(\alpha = (2-n)/2\).  相似文献   

6.
Denoising has to do with estimating a signal \(\mathbf {x}_0\) from its noisy observations \(\mathbf {y}=\mathbf {x}_0+\mathbf {z}\). In this paper, we focus on the “structured denoising problem,” where the signal \(\mathbf {x}_0\) possesses a certain structure and \(\mathbf {z}\) has independent normally distributed entries with mean zero and variance \(\sigma ^2\). We employ a structure-inducing convex function \(f(\cdot )\) and solve \(\min _\mathbf {x}\{\frac{1}{2}\Vert \mathbf {y}-\mathbf {x}\Vert _2^2+\sigma {\lambda }f(\mathbf {x})\}\) to estimate \(\mathbf {x}_0\), for some \(\lambda >0\). Common choices for \(f(\cdot )\) include the \(\ell _1\) norm for sparse vectors, the \(\ell _1-\ell _2\) norm for block-sparse signals and the nuclear norm for low-rank matrices. The metric we use to evaluate the performance of an estimate \(\mathbf {x}^*\) is the normalized mean-squared error \(\text {NMSE}(\sigma )=\frac{{\mathbb {E}}\Vert \mathbf {x}^*-\mathbf {x}_0\Vert _2^2}{\sigma ^2}\). We show that NMSE is maximized as \(\sigma \rightarrow 0\) and we find the exact worst-case NMSE, which has a simple geometric interpretation: the mean-squared distance of a standard normal vector to the \({\lambda }\)-scaled subdifferential \({\lambda }\partial f(\mathbf {x}_0)\). When \({\lambda }\) is optimally tuned to minimize the worst-case NMSE, our results can be related to the constrained denoising problem \(\min _{f(\mathbf {x})\le f(\mathbf {x}_0)}\{\Vert \mathbf {y}-\mathbf {x}\Vert _2\}\). The paper also connects these results to the generalized LASSO problem, in which one solves \(\min _{f(\mathbf {x})\le f(\mathbf {x}_0)}\{\Vert \mathbf {y}-{\mathbf {A}}\mathbf {x}\Vert _2\}\) to estimate \(\mathbf {x}_0\) from noisy linear observations \(\mathbf {y}={\mathbf {A}}\mathbf {x}_0+\mathbf {z}\). We show that certain properties of the LASSO problem are closely related to the denoising problem. In particular, we characterize the normalized LASSO cost and show that it exhibits a “phase transition” as a function of number of observations. We also provide an order-optimal bound for the LASSO error in terms of the mean-squared distance. Our results are significant in two ways. First, we find a simple formula for the performance of a general convex estimator. Secondly, we establish a connection between the denoising and linear inverse problems.  相似文献   

7.
Let \(\overline{A}_{\ell }(n)\) be the number of overpartitions of n into parts not divisible by \(\ell \). In a recent paper, Shen calls the overpartitions enumerated by the function \(\overline{A}_{\ell }(n)\) as \(\ell \)-regular overpartitions. In this paper, we find certain congruences for \(\overline{A}_{\ell }(n)\), when \(\ell =4, 8\), and 9. Recently, Andrews introduced the partition function \(\overline{C}_{k, i}(n)\), called singular overpartition, which counts the number of overpartitions of n in which no part is divisible by k and only parts \(\equiv \pm i\pmod {k}\) may be over-lined. He also proved that \(\overline{C}_{3, 1}(9n+3)\) and \(\overline{C}_{3, 1}(9n+6)\) are divisible by 3. In this paper, we prove that \(\overline{C}_{3, 1}(12n+11)\) is divisible by 144 which was conjectured to be true by Naika and Gireesh.  相似文献   

8.
In this paper we consider the compactness of \(\beta \)-symplectic critical surfaces in a Kähler surface. Let M be a compact Kähler surface and \(\Sigma _i\subset M\) be a sequence of closed \(\beta _i\)-symplectic critical surfaces with \(\beta _i\rightarrow \beta _0\in (0,\infty )\). Suppose the quantity \(\int _{\Sigma _i}\frac{1}{\cos ^q\alpha _i}d\mu _i\) (for some \(q>4\)) and the genus of \(\Sigma _{i}\) are bounded, then there exists a finite set of points \({{\mathcal {S}}}\subset M\) and a subsequence \(\Sigma _{i'}\) which converges uniformly in the \(C^l\) topology (for any \(l<\infty \)) on compact subsets of \(M\backslash {{\mathcal {S}}}\) to a \(\beta _0\)-symplectic critical surface \(\Sigma \subset M\), each connected component of \(\Sigma \setminus {{\mathcal {S}}}\) can be extended smoothly across \({{\mathcal {S}}}\).  相似文献   

9.
The accurate estimation of a precision matrix plays a crucial role in the current age of high-dimensional data explosion. To deal with this problem, one of the prominent and commonly used techniques is the \(\ell _1\) norm (Lasso) penalization for a given loss function. This approach guarantees the sparsity of the precision matrix estimate for properly selected penalty parameters. However, the \(\ell _1\) norm penalization often fails to control the bias of obtained estimator because of its overestimation behavior. In this paper, we introduce two adaptive extensions of the recently proposed \(\ell _1\) norm penalized D-trace loss minimization method. They aim at reducing the produced bias in the estimator. Extensive numerical results, using both simulated and real datasets, show the advantage of our proposed estimators.  相似文献   

10.
We prove Nikol’skii type inequalities that, for polynomials on the n-dimensional torus \(\mathbb {T}^n\), relate the \(L^p\)-norm with the \(L^q\)-norm (with respect to the normalized Lebesgue measure and \(0 <p <q < \infty \)). Among other things, we show that \(C=\sqrt{q/p}\) is the best constant such that \(\Vert P\Vert _{L^q}\le C^{\text {deg}(P)} \Vert P\Vert _{L^p}\) for all homogeneous polynomials P on \(\mathbb {T}^n\). We also prove an exact inequality between the \(L^p\)-norm of a polynomial P on \(\mathbb {T}^n\) and its Mahler measure M(P), which is the geometric mean of |P| with respect to the normalized Lebesgue measure on \(\mathbb {T}^n\). Using extrapolation, we transfer this estimate into a Khintchine–Kahane type inequality, which, for polynomials on \(\mathbb {T}^n\), relates a certain exponential Orlicz norm and Mahler’s measure. Applications are given, including some interpolation estimates.  相似文献   

11.
Let \(\mathcal S\) be an abelian group of automorphisms of a probability space \((X, {\mathcal A}, \mu )\) with a finite system of generators \((A_1, \ldots , A_d).\) Let \(A^{{\underline{\ell }}}\) denote \(A_1^{\ell _1} \ldots A_d^{\ell _d}\), for \({{\underline{\ell }}}= (\ell _1, \ldots , \ell _d).\) If \((Z_k)\) is a random walk on \({\mathbb {Z}}^d\), one can study the asymptotic distribution of the sums \(\sum _{k=0}^{n-1} \, f \circ A^{\,{Z_k(\omega )}}\) and \(\sum _{{\underline{\ell }}\in {\mathbb {Z}}^d} {\mathbb {P}}(Z_n= {\underline{\ell }}) \, A^{\underline{\ell }}f\), for a function f on X. In particular, given a random walk on commuting matrices in \(SL(\rho , {\mathbb {Z}})\) or in \({\mathcal M}^*(\rho , {\mathbb {Z}})\) acting on the torus \({\mathbb {T}}^\rho \), \(\rho \ge 1\), what is the asymptotic distribution of the associated ergodic sums along the random walk for a smooth function on \({\mathbb {T}}^\rho \) after normalization? In this paper, we prove a central limit theorem when X is a compact abelian connected group G endowed with its Haar measure (e.g., a torus or a connected extension of a torus), \(\mathcal S\) a totally ergodic d-dimensional group of commuting algebraic automorphisms of G and f a regular function on G. The proof is based on the cumulant method and on preliminary results on random walks.  相似文献   

12.
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly \(\ell \)-walk-regular with \(\ell > 1\) if the number of walks of length \(\ell \) from a vertex to another vertex depends only on whether the first vertex is the same as, adjacent to, or not adjacent to the second vertex. This generalizes also the well-studied strongly regular digraphs and a problem posed by Hoffman. Our main tools are eigenvalue methods. The case that the adjacency matrix is diagonalizable with only real eigenvalues resembles the undirected case. We show that a digraph \(\varGamma \) with only real eigenvalues whose adjacency matrix is not diagonalizable has at most two values of \(\ell \) for which \(\varGamma \) can be strongly \(\ell \)-walk-regular, and we also construct examples of such strongly walk-regular digraphs. We also consider digraphs with non-real eigenvalues. We give such examples and characterize those digraphs \(\varGamma \) for which there are infinitely many \(\ell \) for which \(\varGamma \) is strongly \(\ell \)-walk-regular.  相似文献   

13.
We prove a dichotomy between absolute continuity and singularity of the Ginibre point process \(\mathsf {G}\) and its reduced Palm measures \(\{\mathsf {G}_{\mathbf {x}}, \mathbf {x} \in \mathbb {C}^{\ell }, \ell = 0,1,2\ldots \}\), namely, reduced Palm measures \(\mathsf {G}_{\mathbf {x}}\) and \(\mathsf {G}_{\mathbf {y}}\) for \(\mathbf {x} \in \mathbb {C}^{\ell }\) and \(\mathbf {y} \in \mathbb {C}^{n}\) are mutually absolutely continuous if and only if \(\ell = n\); they are singular each other if and only if \(\ell \not = n\). Furthermore, we give an explicit expression of the Radon–Nikodym density \(d\mathsf {G}_{\mathbf {x}}/d \mathsf {G}_{\mathbf {y}}\) for \(\mathbf {x}, \mathbf {y} \in \mathbb {C}^{\ell }\).  相似文献   

14.
Let \(\bar{p}(n)\) denote the number of overpartitions of \(n\). Recently, Fortin–Jacob–Mathieu and Hirschhorn–Sellers independently obtained 2-, 3- and 4-dissections of the generating function for \(\bar{p}(n)\) and derived a number of congruences for \(\bar{p}(n)\) modulo 4, 8 and 64 including \(\bar{p}(8n+7)\equiv 0 \pmod {64}\) for \(n\ge 0\). In this paper, we give a 16-dissection of the generating function for \(\bar{p}(n)\) modulo 16 and show that \(\bar{p}(16n+14)\equiv 0\pmod {16}\) for \(n\ge 0\). Moreover, using the \(2\)-adic expansion of the generating function for \(\bar{p}(n)\) according to Mahlburg, we obtain that \(\bar{p}(\ell ^2n+r\ell )\equiv 0\pmod {16}\), where \(n\ge 0\), \(\ell \equiv -1\pmod {8}\) is an odd prime and \(r\) is a positive integer with \(\ell \not \mid r\). In particular, for \(\ell =7\) and \(n\ge 0\), we get \(\bar{p}(49n+7)\equiv 0\pmod {16}\) and \(\bar{p}(49n+14)\equiv 0\pmod {16}\). We also find four congruence relations: \(\bar{p}(4n)\equiv (-1)^n\bar{p}(n) \pmod {16}\) for \(n\ge 0\), \(\bar{p}(4n)\equiv (-1)^n\bar{p}(n)\pmod {32}\) where \(n\) is not a square of an odd positive integer, \(\bar{p}(4n)\equiv (-1)^n\bar{p}(n)\pmod {64}\) for \(n\not \equiv 1,2,5\pmod {8}\) and \(\bar{p}(4n)\equiv (-1)^n\bar{p}(n)\pmod {128}\) for \(n\equiv 0\pmod {4}\).  相似文献   

15.
It is proved that if \(\phi \) is a finite Blaschke product with four zeros, then \(M_\phi \) is reducible on the Dirichlet space with norm \(\Vert \ \Vert \) if and only if \(\phi =\phi _1\circ \phi _2\), where \(\phi _1, \phi _2\) are Blaschke products and \(\phi _2\) is equivalent to \(z^2\). Also, the same reducibility of \(M_\phi \) with finite Blaschke product \(\phi \) on the Dirichlet space under the equivalent norms \(\Vert \ \Vert _1\) and \(\Vert \ \Vert _0\) is given.  相似文献   

16.
Let \(\kappa \) be a field, finitely generated over its prime field, and let k denote an algebraically closed field containing \(\kappa \). For a perverse \(\overline{\mathbb {Q}}_\ell \)-adic sheaf \(K_0\) on an abelian variety \(X_0\) over \(\kappa \), let K and X denote the base field extensions of \(K_0\) and \(X_0\) to k. Then, the aim of this note is to show that the Euler–Poincare characteristic of the perverse sheaf K on X is a non-negative integer, i.e. \(\chi (X,K)=\sum _\nu (-1)^\nu \dim _{\overline{\mathbb {Q}}_\ell }(H^\nu (X,K))\ge 0\). This generalizes the result of Franecki and Kapranov [9] for fields of characteristic zero. Furthermore we show that \(\chi (X,K)=0\) implies K to be translation invariant. This result allows to considerably simplify the proof of the generic vanishing theorems for constructible sheaves on complex abelian varieties of [11]. Furthermore it extends these vanishing theorems to constructible sheaves on abelian varieties over finite fields.  相似文献   

17.
We find several new congruences for \(\ell \)-regular partitions for \(\ell \in \{5,6,7,49\}\) and also find alternative proofs of the congruences for 10- and 20-regular partitions which were proved earlier by Carlson and Webb (Ramanujan J 33:329–337, 2014) by using the theory of modular forms. We use certain p-dissections of \((q;q)_{\infty }\), \(\psi (q)\), \((q;q)_{\infty }^3\) and \(\psi (q^2)(q;q)_{\infty }^2\).  相似文献   

18.
Marta Strzelecka 《Positivity》2017,21(4):1425-1438
We give a solution to the isoperimetric problem for the exponential measure on the plane with the \(\ell _1\)-metric. As it turns out, among all sets of a given measure, the simplex or its complement (i.e. the ball in the \(\ell _1\)-metric or its complement) has the smallest boundary measure. The proof is based on a symmetrisation (along the sections of equal \(\ell _1\)-distance from the origin).  相似文献   

19.
In this paper we focus on the algebraic geometry of the variety of \(\ell \)-groups (i.e. lattice ordered abelian groups). In particular we study the role of the introduction of constants in functional spaces and \(\ell \)-polynomial spaces, which are themselves \(\ell \)-groups, evaluated over other \(\ell \)-groups. We use different tools and techniques, with an increasing level of abstraction, to describe properties of \(\ell \)-groups, topological spaces (with the Zariski topology) and a formal logic, all linked by the underlying theme of solutions of \(\ell \)-equations.  相似文献   

20.
In this paper, we study \(\lambda \)-constacyclic codes over the ring \(R=\mathbb {Z}_4+u\mathbb {Z}_4\) where \(u^{2}=1\), for \(\lambda =3+2u\) and \(2+3u\). Two new Gray maps from R to \(\mathbb {Z}_4^{3}\) are defined with the goal of obtaining new linear codes over \(\mathbb {Z}_4\). The Gray images of \(\lambda \)-constacyclic codes over R are determined. We then conducted a computer search and obtained many \(\lambda \)-constacyclic codes over R whose \(\mathbb {Z}_4\)-images have better parameters than currently best-known linear codes over \(\mathbb {Z}_4\).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号