On Convergence Properties of Message-Passing Estimation Algorithms

Abstract

The convergence and stability properties of several message-passing estimation algorithms are investigated, i.e., (generalized) expectation maximization, gradient methods, and coordinate ascent/descent. Results are presented for cycle-free and cyclic factor graphs.