The alternating direction method of multipliers (ADMM) is a popular and efficient first-order method that has recently found numerous applications, and the proximal ADMM is an important variant of it. The main contributions of this paper are the proposition and the analysis of a class of inertial proximal ADMMs, which unify the basic ideas of the inertial proximal point method and the proximal ADMM, for linearly constrained separable convex optimization. This class of methods are of inertial nature because at each iteration the proximal ADMM is applied to a point extrapolated at the current iterate in the direction of last movement. The recently proposed inertial primal-dual algorithm [A. Chambolle and T. Pock, On the ergodic convergence rates of a first-order primaldual algorithm, preprint, 2014, Algorithm 3] and the inertial linearized ADMM [C. Chen, S. Ma, and J. Yang, arXiv:1407.8238, eq. (3.23)] are covered as special cases. The proposed algorithmic framework is very general in the sense that the weighting matrices in the proximal terms are allowed to be only positive semidefinite, but not necessarily positive definite as required by existing methods of the same kind. By setting the two proximal terms to zero, we obtain an inertial variant of the classical ADMM, which is to the best of our knowledge new. We carry out a unified analysis for the entire class of methods under very mild assumptions. In particular, convergence, as well as asymptotic $o(1/\sqrt{k})$ and nonasymptotic $O(1/\sqrt{k})$ rates of convergence, are established for the best primal function value and feasibility residues, where k denotes the iteration counter. The global iterate convergence of the generated sequence is established under an additional assumption. We also present extensive experimental results on total variation–based image reconstruction problems to illustrate the profits gained by introducing the inertial extrapolation steps.

This article considers experimental design based on the strategy of rerandomization to increase the efficiency in experiments. Two aspects of rerandomization are addressed. First, we propose a two-stage allocation sample scheme for randomization inference to the units in experiments that guarantees that the difference-in-mean estimator is an unbiased estimator of the sample average treatment effect for any experiment, conserves the exactness of randomization inference, and halves the time consumption of the rerandomization design. Second, we propose a rank-based covariate-balance measure which can take into account the estimated relative weight of each covariate. Several strategies for estimating these weights using pre-experimental data are proposed. Using Monte Carlo simulations, the proposed strategies are compared to complete randomization and Mahalanobis-based rerandomization. An empirical example is given where the power of a mean difference test of electricity consumption of 54 households is increased by 99%, in comparison to complete randomization, using one of the proposed designs based on high frequency longitudinal electricity consumption data. Supplementary materials for this article are available online.

No abstract uploaded!

For spacetimes that are not asymptotic to anti-de Sitter Space (non AAdS), we adapt the Lewkowycz-Maldacena procedure to find the holographic entanglement entropy. The key observation, which to our knowledge is not very well appreciated, is that asymptotic boundary conditions play an essential role on extending the replica trick to the bulk. For non AAdS, we expect the following three main modifications: (1) the expansion near the special surface has to be compatible with the asymptotic expansion; (2) periodic conditions are imposed to coordinates on the phase space with diagonalized symplectic structure, not to all fields appearing in the action; (3) evaluating the entanglement functional using the boundary term method amounts to evaluating the presymplectic structure at the special surface, where some additional exact form may contribute. An explicit calculation is carried out for three-dimensional warped anti-de Sitter spacetime (WAdS3) in a consistent truncation of string theory, the so-called S-dual dipole theory. It turns out that the generalized gravitational entropy in WAdS3 is captured by the least action of a charged particle in WAdS3 space, or equivalently, by the geodesic length in an auxiliary AdS3. Consequently, the bulk calculation agrees with the CFT results, providing another piece of evidence for the WAdS3/CFT2 correspondence.

No abstract uploaded!