Local convergence analysis of the goal coordination algorithm of hierarchical control

The goal coordination (interaction balance) method of hierarchical control is analyzed from a numerical analysis point of view. It is found that for fixed stepsize gradient algorithms the fastest possible asymptotic convergence rate is sublinear. It is shown that this difficulty is fundamental to the problem formulation and that acceleration techniques are not likely to be of much value.