Iterative minimization of quadratic functionals

From MaRDI portal





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.











This page was built for publication: Iterative minimization of quadratic functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901494)