A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems (Q2290912): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11075-019-00688-9 / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128102701 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11075-019-00688-9 / rank | |||
Normal rank |
Latest revision as of 20:40, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems |
scientific article |
Statements
A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems (English)
0 references
29 January 2020
0 references
accretive operator
0 references
convex programming
0 references
feasibility problem
0 references
fixed point
0 references
\(S\)-iteration process
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references