This paper focuses on coordinate update methods, which are useful for solving problems involving large or high-dimensional datasets. They decompose a problem into simple subproblems, where each updates one, or a small block of, variables while fixing others. These methods can deal with linear and nonlinear mappings, smooth and nonsmooth functions, as well as convex and nonconvex problems. In addition, they are easy to parallelize. The great performance of coordinate update methods depends on solving simple sub-problems. To derive simple subproblems for several new classes of applications, this paper systematically studies coordinate-friendly operators that perform low-cost coordinate updates. Based on the discovered coordinate friendly operators, as well as operator splitting techniques, we obtain new coordinate update algorithms for a variety of problems in machine learning, image processing, as well as sub-areas of optimization. Several problems are treated with coordinate update for the first time in history. The obtained algorithms are scalable to large instances through parallel and even asynchronous computing. We present numerical examples to illustrate how effective these algorithms are.

We prove a sharp Bernstein inequality for general-state-space and not necessarily reversible Markov chains. It is sharp in the sense that the variance proxy term is optimal. Our result covers the classical Bernstein's inequality for independent random variables as a special case.

In this paper, we give an almost complete classication of toric surface codes of dimension less than or equal to 7, according to monomially equivalence. This is a natural extension of our previous work [YZ], [LYZZ]. More pairs of monomially equivalent toric codes constructed from non-equivalent lattice polytopes are discovered. A new phenomenon appears, that is, the monomially non-equivalence of two toric codes C P(10)7and CP(19)7 can be discerned on Fq, for all q  8, except q = 29. This sudden break seems to be strange and interesting. Moreover, the parameters, such as the numbers of codewords with dierent weights, depends on q heavily. More meticulous analyses have been made to have the possible distinct families of reducible polynomials.

To a torus action on a complex vector space, Gelfand, Kapranov and Zelevinsky introduce a system of differential equations, called the GKZ hypergeometric system. Its solutions are GKZ hypergeometric functions. We study the $p$-adic counterpart of the GKZ hypergeometric system. In the language of dagger spaces introduced by Grosse-Kl\"onne, the $p$-adic GKZ hypergeometric complex is a twisted relative de Rham complex of meromorphic differential forms with logarithmic poles for an affinoid toric dagger space over the dagger unit polydisc. It is a complex of ${\mathcal O}^\dagger$-modules with integrable connections and with Frobenius structures defined on the dagger unit polydisc such that traces of Frobenius on fibers at Techm\"uller points define the hypergeometric function over the finite field introduced by Gelfand and Graev.

We consider the flow of closed convex hypersurfaces in Euclidean space R^{n+1} with speed given by a power of the k-th mean curvature E_k plus a global term chosen to impose a constraint involving the enclosed volume V_{n+1} and the mixed volume V_{n+1−k} of the evolving hypersurface. We prove that if the initial hypersurface is strictly convex, then the solution of the flow exists for all time and converges to a round sphere smoothly. No curvature pinching assumption is required on the initial hypersurface.