Convergence of a block coordinate descent method for nondifferentiable minimization

We study the convergence properties of a (block) coordinate descent method applied to minimize a nondifferentiable (nonconvex) function f(x(I),..., x(n)) with certain separability and regularity properties. Assuming that f is continuous on a compact level set, the subsequence convergence of the iterates to a stationary point is shown when either f is pseudoconvex in every pair of coordinate blocks from among N - 1 coordinate blocks orf has at most one minimum in each of N - 2 coordinate blocks. If f is quasiconvex and hemivariate in every coordinate block, then the assumptions of continuity off and compactness of the level set may be relaxed further. These results are applied to derive new land old) convergence results for the proximal minimization algorithm, an algorithm of Arimoto and Blahut, and an algorithm of Han. They are applied also to a problem of blind source separation.