Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 188

The DOI matches its Crossref record.

Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers

Monteiro, Renato D. C., Svaiter, Benar F.·2013·SIAM Journal on Optimization

Abstract

In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by showing that any method in this framework is also a special instance of the hybrid proximal extragradient (HPE) method introduced by Solodov and Svaiter, we derive corresponding convergence rate results. We also describe some instances of the framework based on specific and inexpensive schemes for solving the single-block proximal subproblems. Finally, we consider some applications of our methodology to establish for the first time (i) the iteration-complexity of an algorithm for finding a zero of the sum of two arbitrary maximal monotone operators and, as a consequence, the ergodic iteration-complexity of the Douglas--Rachford splitting method and (ii) the ergodic iteration-complexity of the classical alternating direction method of multipliers for a class of linearly constrained convex programming problems with proper closed convex objective functions.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/110849468

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 188

Metadata

Authors
Monteiro, R. D. C., & Svaiter, B. F.
Venue
SIAM Journal on Optimization
Published
2013-01
Volume
23
Issue
1
Pages
475-507
ISSN
  • 1052-6234 (ISSN-L)
  • 1095-7189
OpenAlex
W2094631364
Cited by
188
References
0
FWCI
21.60
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. https://app.cochat.ai/papers/10.1137/110849468
The paper
Monteiro, R. D. C., & Svaiter, B. F. (2013). Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. SIAM Journal on Optimization. https://doi.org/10.1137/110849468

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.