A discrete conformality for hyperbolic polyhedral surfaces is introduced in this paper. This discrete conformality is shown to be computable. It is proved that each hyperbolic polyhedral metric on a closed surface is discrete conformal to a unique hyperbolic polyhedral metric with a given discrete curvature satisfying Gauss-Bonnet formula. Furthermore, the hyperbolic polyhedral metric with given curvature can be obtained using a discrete Yamabe flow with surgery. In particular, each hyperbolic polyhedral metric on a closed surface with negative Euler characteristic is discrete conformal to a unique hyperbolic metric.

A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which generalizes earlier work on the subject. It is shown that each polyhedral metric on a surface is discrete conformal to a constant curvature polyhedral metric which is unique up to scaling. Furthermore, the constant curvature metric can be found using a discrete Yamabe flow with surgery.

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.

The mixed width-integrals of convex bodies are defined by E. Lutwak. In this paper, the mixed brightness-integrals of convex bodies are defined. An inequality is established for the mixed brightness-integrals analogous to the Fenchel-Aleksandrov inequality for the mixed volumes. An isoperimetric inequality (involving the mixed brightness-integrals) is presented which generalizes an inequality recently obtained by Chakerian and Heil. Strengthened version of this general inequality is obtained by introducing indexed mixed brightness-integrals.

In this paper, a dual Orlicz–Brunn–Minkowski theory is presented. An Orlicz radial sum and dual Orlicz mixed volumes are introduced. The dual Orlicz–Minkowski inequality and the dual Orlicz–Brunn–Minkowski inequality are estab-lished. The variational formula for the volume with respect to the Orlicz radial sum is proved. The equivalence between the dual Orlicz–Minkowski inequality and the dual Orlicz–Brunn–Minkowski inequality is demonstrated. Orlicz intersection bodies are defined and the Orlicz–Busemann–Petty problem is posed.