In recent years, sparse coding has been widely used in many applications ranging from image processing to pattern recognition. Most existing sparse coding based applications require solving a class of challenging non-smooth and non-convex optimization problems. Despite the fact that many numerical methods have been developed for solving these problems, it remains an open problem to find a numerical method which is not only empirically fast, but also has mathematically guaranteed strong convergence. In this paper, we propose an alternating iteration scheme for solving such problems. A rigorous convergence analysis shows that the proposed method satisfies the global convergence property: the whole sequence of iterates is convergent and converges to a critical point. Besides the theoretical soundness, the practical benefit of the proposed method is validated in applications including image restoration and recognition. Experiments show that the proposed method achieves similar results with less computation when compared to widely used methods such as K-SVD.

No abstract uploaded!

We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we characterize the set$S$of all points that are connected to the root by more than one geodesic. The set$S$is dense in the Brownian map and homeomorphic to a non-compact real tree. Furthermore, for every$x$in$S$, the number of distinct geodesics from x to the root is equal to the number of connected components of$S$\{$x$}. In particular, points of the Brownian map can be connected to the root by at most three distinct geodesics. Our results have applications to the behavior of geodesics in large planar maps.

In this paper we prove the Iwasawa main conjecture for the Rankin-Selberg product of a general modular form and a CM form of higher weight. This result has been used by others to prove the converse of the theorem of Gross-Zagier and Kolyvagin, and the BSD formula for elliptic curves of analytic rank one.

No abstract uploaded!