Abstract
A method for solving convex optimization problems in Hilbert spaces, based on the principle of goal coordination, is described. This general approach is then applied to a linear quadratic control problem, which is assumed to have a special structure. The arising informal problems of smaller dimension and without dynamics must be solved several times. The method is illustrated by an example.