On an application of convexity to discrete systems (Q1073750)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On an application of convexity to discrete systems |
scientific article; zbMATH DE number 3946003
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an application of convexity to discrete systems |
scientific article; zbMATH DE number 3946003 |
Statements
On an application of convexity to discrete systems (English)
0 references
1986
0 references
We prove the following result: Let A be a symmetric matrix, f be a gradient (or certain subgradient) of a convex function, and \(\{y_ i\}\) be a sequence defined by \(y_{i+1}=f(Ay_ i)\), \(y_ 0\) arbitrary. Then the only possible periods of \(\{y_ i\}\) are 1 or 2.
0 references
convexity, discrete systems
0 references
