No label defined (Q3035147)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4133840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4133840 |
Statements
1989
0 references
decomposition
0 references
monotone operator
0 references
penalty
0 references
regularization
0 references
proximal point algorithm
0 references
successive approximations
0 references
survey
0 references
epiconvergence
0 references
0.8687301874160767
0 references
0.8684488534927368
0 references
0.8291818499565125
0 references
0.8257974982261658
0 references
0.8228606581687927
0 references
[For the entire collection see Zbl 0679.00019.] The proximal algorithm or, more exactly, ``the proximal point algorithm'', according to Rockafellar's terminology, is mainly the successive approximations method for finding fixed points of some nonexpansive mappings in Hilbert spaces. This method, which is therefore not new but was used before [\textit{M. A. Krasnosel'skij}, Usp. Mat. Nauk 10, No.1(63), 123-127 (1955; Zbl 0064.120); \textit{Z. Opial}, Bull. Am. Math. Soc. 73, 591-597 (1967; Zbl 0179.199)] for regularizing linear equations [\textit{M. A. Krasnosel'skij}, Usp. Mat. Nauk 15, No.3(93), 161- 165 (1960; Zbl 0095.315); \textit{A. V. Krjanev}, Sov. Math., Dokl. 14, 673- 676 (1973; Zbl 0294.47008)] seems to have been applied for the first time to convex optimization by \textit{B. Martinet} [Rev. Française Inform. Rech. Oper. 4, No.R-3, 154-158 (1970; Zbl 0215.211); ``Algorithmes pour la résolution de problèmes d'optimisation et de minimax'', Thèse d'Etat, Univ. Grenoble (1972)]. The first important results (approximate version, linear and finite convergence) in the general framework of maximal monotone inclusions are due to \textit{R. T. Rockafellar} [Math. Oper. Res. 1, 97-116 (1976; Zbl 0402.90076)]. More recently, a lot of work has been devoted to this algorithm and nowadays it is still the object of intensive investigation. In this survey we present the main properties and applications of the proximal algorithm and some recent developments in convex programming, especially its association with other approximation methods, for instance, epiconvergence.
0 references