Maximal monotone operators and the proximal point algorithm in the presence of computational errors (Q637560): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 08:20, 30 January 2024

scientific article
Language Label Description Also known as
English
Maximal monotone operators and the proximal point algorithm in the presence of computational errors
scientific article

    Statements

    Maximal monotone operators and the proximal point algorithm in the presence of computational errors (English)
    0 references
    6 September 2011
    0 references
    The concept of the maximal monotone operator is introduced. The problem of the inclusion induced by a maximal monotone operator under the presence of computational errors is considered. The author uses the proximal point method to solve the problem. The convergence of the method is established for nonsummable computational errors. It is shown that the method provides a good approximate solution if the sequence of computational errors is bounded from above by a constant.
    0 references
    Euclidean space
    0 references
    maximal monotone operator
    0 references
    nonexpansive operator
    0 references
    proximal method
    0 references

    Identifiers