Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Iterative regularization method with a proximal operator - MaRDI portal

Iterative regularization method with a proximal operator (Q1974712)

From MaRDI portal





scientific article; zbMATH DE number 1440436
Language Label Description Also known as
English
Iterative regularization method with a proximal operator
scientific article; zbMATH DE number 1440436

    Statements

    Iterative regularization method with a proximal operator (English)
    0 references
    0 references
    18 June 2000
    0 references
    The author considers the mathematical programming problem of finding an element \(y\in H\), a Hilbert space, such that \(f(y)= \inf f(z)\), \(z\in Q\), where \(Q\) is a convex closed set of \(H\). In practice the information about \(f\) and \(Q\) is of approximate character, i.e. instead of \(f\) and \(Q\) we have some function and a set \(Q_n\). A version of the Bakushinskij-Polyak method with a proximal operator is used for solving an unstable approximate mathematical programming problem with constraints in the Hilbert space \(H\). A new form of the regularization operator is proposed and based on this result minimizing sequence \(z_n\) has been constructed such that \(\lim_{n\to\infty}\|z_n-y\|= 0\).
    0 references
    mathematical programming
    0 references
    proximal operator
    0 references
    unstable problem
    0 references
    regularization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references