The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
Open accessAbstract
Recently Han and Lou proposed a highly parallelizable decomposition algorithm for minimizing a strongly convex cost over the intersection of closed convex sets. It is shown that their algorithm is in fact a special case of a splitting algorithm analyzed by Gabay for finding a zero of the sum of two maximal monotone operators. Gabay’s convergence analysis for the splitting algorithm is sharpened, and new applications of this algorithm to variational inequalities, convex programming, and the solution of linear complementarily problems are proposed. For convex programs with a certain separable structure, a multiplier method that is closely related to the alternating direction method of multipliers of Gabay–Mercier and of Glowinski–Marrocco, but which uses both ordinary and augmented Lagrangians, is obtained.
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
Gantmacher, F. R. (1984) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 8,520
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Deimling, K. (1985) · Springer eBooks · doi:10.1007/978-3-662-00547-7 · Cited by 5,029
An Introduction to Variational Inequalities and Their Applications
Kinderlehrer, D., & Stampacchia, G. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719451 · Cited by 4,433
Iterative Solution of Nonlinear Equations in Several Variables
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
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
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
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
Self-citationAlternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
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
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
Zhang, X., Burger, M., Bresson, X., & Osher, S. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090746379 · Cited by 688
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
He, B. S., Yang, H., & Wang, S. L. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1004603514434 · Cited by 465
Solving monotone inclusions via compositions of nonexpansive averaged operators
Combettes *, P. L. (2004) · Optimization · doi:10.1080/02331930412331327157 · Cited by 457
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
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
A Generalized Forward-Backward Splitting
Raguet, H., Fadili, J., & Peyré, G. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120872802 · Cited by 352
Compressed Sensing With Quantized Measurements
Zymnis, A., Boyd, S., & Candes, E. (2010) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2035667 · Cited by 316
Global Convergence of Splitting Methods for Nonconvex Composite Optimization
Li, G., & Pong, T. K. (2015) · SIAM Journal on Optimization · doi:10.1137/140998135 · Cited by 315
Efficient MR image reconstruction for compressed MR imaging
Huang, J., Zhang, S., & Metaxas, D. (2011) · Medical Image Analysis · doi:10.1016/j.media.2011.06.001 · Cited by 307
Convergence Rates in Forward--Backward Splitting
Chen, G. H.-G., & Rockafellar, R. T. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495290179 · Cited by 285
Ng, M. K., Weiss, P., & Yuan, X. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090774823 · Cited by 266
Metadata
- Authors
- Tseng, P.
- Venue
- SIAM Journal on Control and Optimization
- Published
- 1991-01
- Volume
- 29
- Issue
- 1
- Pages
- 119-138
- ISSN
- 0363-0129 (ISSN-L)
- 1095-7138
- OpenAlex
- W1970986119
- Cited by
- 467
- References
- 40
- FWCI
- 2.84
- Type
- journal article
- Language
- en
- Open access
- green
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.