- Algorithms for the proportional rounding of a nonnegative vector, and for the biproportional rounding of a nonnegative matrix are discussed. Here we view vector and matrix rounding as special instances of a generic optimization problem that employs an additive version of the objective function of Gaffke and Pukelsheim (2007). The generic problem turns out to be a separable convex integer optimization problem, in which the linear equality constraints are given by a totally unimodular coefficient matrix. So, despite the integer restrictions of the variables, Fenchel duality applies. Our chief goal is to study the implied algorithmic consequences. We establish a general algorithm based on the primal optimization problem. Furthermore we show that the biproportional algorithm of Balinski and Demange (1989), when suitably generalized, derives from the dual optimization problem. Finally we comment on the shortcomings of the alternating scaling algorithm, a discrete variant of the well-knownAlgorithms for the proportional rounding of a nonnegative vector, and for the biproportional rounding of a nonnegative matrix are discussed. Here we view vector and matrix rounding as special instances of a generic optimization problem that employs an additive version of the objective function of Gaffke and Pukelsheim (2007). The generic problem turns out to be a separable convex integer optimization problem, in which the linear equality constraints are given by a totally unimodular coefficient matrix. So, despite the integer restrictions of the variables, Fenchel duality applies. Our chief goal is to study the implied algorithmic consequences. We establish a general algorithm based on the primal optimization problem. Furthermore we show that the biproportional algorithm of Balinski and Demange (1989), when suitably generalized, derives from the dual optimization problem. Finally we comment on the shortcomings of the alternating scaling algorithm, a discrete variant of the well-known Iterative Proportional Fitting procedure.…
