The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Inertial Douglas–Rachford splitting for monotone inclusion problems
Abstract
We propose an inertial Douglas-Rachford splitting algorithm for finding the set of zeros of the sum of two maximally monotone operators in Hilbert spaces and investigate its convergence properties. To this end we formulate first the inertial version of the Krasnosel'skii?-Mann algorithm for approximating the set of fixed points of a nonexpansive operator, for which we also provide an exhaustive convergence analysis. By using a product space approach we employ these results to the solving of monotone inclusion problems involving linearly composed and parallel-sum type operators and provide in this way iterative schemes where each of the maximally monotone mappings is accessed separately via its resolvent. We consider also the special instance of solving a primal-dual pair of nonsmooth convex optimization problems and illustrate the theoretical results via some numerical experiments in clustering and location theory.
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
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
Convex Analysis and Variational Problems
(1976) · Studies in Mathematics and Its Applications · doi:10.1016/c2009-0-19672-1 · Cited by 3,806
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
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
On the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Convex Analysis in General Vector Spaces
Zalinescu, C. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/5021 · Cited by 1,518
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
On the maximal monotonicity of subdifferential mappings
Rockafellar, R. (1970) · Pacific Journal of Mathematics · doi:10.2140/pjm.1970.33.209 · Cited by 740
Convex Analysis in General Vector Spaces
Zălinescu, C. (2002) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812777096 · Cited by 535
Solving monotone inclusions via compositions of nonexpansive averaged operators
Combettes *, P. L. (2004) · Optimization · doi:10.1080/02331930412331327157 · Cited by 457
iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
Ochs, P., Chen, Y., Brox, T., & Pock, T. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/130942954 · Cited by 453
Combettes, P. L., & Pesquet, J.-C. (2011) · Set-Valued and Variational Analysis · doi:10.1007/s11228-011-0191-y · Cited by 371
A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
Attouch, H., Peypouquet, J., & Redont, P. (2014) · SIAM Journal on Optimization · doi:10.1137/130910294 · Cited by 194
A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem
Chen, C., Ma, S., & Yang, J. (2015) · SIAM Journal on Optimization · doi:10.1137/140980910 · Cited by 110
Boţ, R. I., & Hendrich, C. (2013) · SIAM Journal on Optimization · doi:10.1137/120901106 · Cited by 109
Self-citationA Parallel Inertial Proximal Optimization Method
Pesquet, J.-C., & Pustelnik, N. (2012) · HAL · Cited by 97
Boţ, R. I., Csetnek, E. R., Heinrich, A., & Hendrich, C. (2014) · Mathematical Programming · doi:10.1007/s10107-014-0766-0 · Cited by 76
Self-citationBoţ, R. I., & Hendrich, C. (2014) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-013-0486-8 · Cited by 75
Self-citation
Cited by
An Inertial Forward-Backward Algorithm for Monotone Inclusions
Lorenz, D. A., & Pock, T. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0523-2 · Cited by 445
Inertial projection and contraction algorithms for variational inequalities
Dong, Q. L., Cho, Y. J., Zhong, L. L., & Rassias, T. M. (2018) · Journal of Global Optimization · doi:10.1007/s10898-017-0506-0 · Cited by 267
Metadata
- Authors
- Boţ, R. I., Csetnek, E. R., & Hendrich, C.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2015-04
- Volume
- 256
- Pages
- 472-487
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W2048408528
- Cited by
- 257
- References
- 22
- FWCI
- 15.31
- 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.