The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Abstract
The proximal point algorithm (PPA) for the convex minimization problem $\min _{x \in H} f(x)$, where $f:H \to R \cup \{ \infty \} $ is a proper, lower semicontinuous (lsc) function in a Hilbert space H is considered. Under this minimal assumption on f, it is proved that the PPA, with positive parameters $\{ \lambda _k \} _{k = 1}^\infty $, converges in general if and only if $\sigma _n = \sum_{k = 1}^n {\lambda _k \to \infty } $. Global convergence rate estimates for the residual $f(x_n ) - f(u)$, where $x_n $ is the nth iterate of the PPA and $ u \in H $ is arbitrary are given. An open question of Rockafellar is settled by giving an example of a PPA for which $x_n $ converges weakly but not strongly to a minimizes of f.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Proximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
Monotone (nonlinear) operators in Hilbert space
Minty, G. J. (1962) · Duke Mathematical Journal · doi:10.1215/s0012-7094-62-02933-2 · Cited by 1,135
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
Tseng, P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012998338806 · Cited by 1,223
Fast Alternating Direction Optimization Methods
Goldstein, T., O'Donoghue, B., Setzer, S., & Baraniuk, R. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/120896219 · Cited by 785
(2025) · Portfolio Optimization · doi:10.1017/9781009428095.021 · Cited by 553
Metadata
- Authors
- Güler, O.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 1991-03
- Volume
- 29
- Issue
- 2
- Pages
- 403-419
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W2099679613
- Cited by
- 681
- References
- 5
- FWCI
- 5.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.