Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function (Q1104051): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126643389, #quickstatements; #temporary_batch_1722494602859 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126643389 / rank | |||
Normal rank |
Latest revision as of 08:45, 1 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function |
scientific article |
Statements
Iterative behaviour, fixed point of a class of monotone operators. Application to non-symmetric threshold function (English)
0 references
1988
0 references
The authors consider the iteration \(x^{KH}=YA^ tXAX^ k\) with \(x^ 0\in {\mathbb{R}}^ n\) arbitrary, where X and Y are subgradients of \(f\in \Gamma_ 0({\mathbb{R}}\) m) and \(g\in \Gamma_ 0({\mathbb{R}}^ n\)), respectively, A is an \(m\times n\) matrix. If f and g are continuous and \(\delta g(0)\supset Y({\mathbb{R}}^ n\)) then \(f(AYA^ tXAx)\geq f(Ax)\) for every A and \(x\in Y({\mathbb{R}}^ n\)). Using this result the convergence of \(\{x^ k\}\) is proved if one of f or g is polyhedral and the corresponding subgradient is discrete.
0 references
iterative behaviour
0 references
fixed point
0 references
monotone operators
0 references
cellular automatas
0 references
multithreshold functions
0 references
optimization
0 references
convergence
0 references
symmetric threshold functions
0 references