Iterative minimization of quadratic functionals
The author considers the gradient algorithm for minimizing convex continuous quadratic functionals in Hilbert spaces. He shows that the algorithm with fixed stepsize converges whenever the stepsize is small enough, and motivates his result by some filtering problems that occur in the theory of discrete time systems.
scientific article; zbMATH DE number 817237
scientific article