arXiv:1210.0056 [math.NA]AbstractReferencesReviewsResources
Convergence and Applications of a Gossip-based Gauss-Newton Algorithm
Published 2012-09-28, updated 2013-06-25Version 2
The Gauss-Newton algorithm is a popular and efficient centralized method for solving non-linear least squares problems. In this paper, we propose a multi-agent distributed version of this algorithm, named Gossip-based Gauss-Newton (GGN) algorithm, which can be applied in general problems with non-convex objectives. Furthermore, we analyze and present sufficient conditions for its convergence and show numerically that the GGN algorithm achieves performance comparable to the centralized algorithm, with graceful degradation in case of network failures. More importantly, the GGN algorithm provides significant performance gains compared to other distributed first order methods.
Comments: accepted by IEEE Transactions on Signal Processing
Related articles: Most relevant | Search more
arXiv:1205.3157 [math.NA] (Published 2012-05-12)
Multi-Adaptive Galerkin Methods for ODEs II: Implementation and Applications
arXiv:math/0610736 [math.NA] (Published 2006-10-24)
Some Refinements of Discrete Jensen's Inequality and Some of Its Applications
arXiv:math/0703410 [math.NA] (Published 2007-03-14)
A Convergence Result for Asynchronous Algorithms and Applications