On the convergence of row-modification algorithm for matrix projections

Abstract

This paper proposes an algorithm for matrix minimum-distance projection, with respect to a metric induced from an inner product that is the sum of inner products of column vectors, onto the collection of all matrices with their rows restricted in closed convex sets. This algorithm produces a sequence of matrices by modifying a matrix row by row, over and over again. It is shown that the sequence is convergent, and it converges to the desired projection. The implementation of the algorithm for multivariate isotonic regressions and numerical examples are also presented in the paper. (C) 2011 Elsevier Inc. All rights reserved.