Iterative minimization of quadratic functionals (Q1901494)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 817237
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative minimization of quadratic functionals |
scientific article; zbMATH DE number 817237 |
Statements
Iterative minimization of quadratic functionals (English)
0 references
8 December 1996
0 references
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.
0 references
quadratic optimization
0 references
contraction
0 references
gradient algorithm
0 references
Hilbert spaces
0 references
filtering
0 references
discrete time systems
0 references
0.92303586
0 references
0.9194679
0 references
0.9162898
0 references
0 references
