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
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Opial, Z. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11761-0 · Cited by 2,340
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
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
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Numerical Methods for Nonlinear Variational Problems
Glowinski, R. (1984) · Springer eBooks · doi:10.1007/978-3-662-12613-4 · Cited by 1,728
Optimization Theory of Large Systems
Lasdon, L. S., & Tabak, D. (1971) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1971.4308301 · Cited by 1,677
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
Numerical Analysis of Variational Inequalities.
Falk, R. S., Glowinski, R., Lions, J. L., & Tremoliers, R. (1982) · Mathematics of Computation · doi:10.2307/2007354 · Cited by 1,365
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Everett, H. (1963) · Operations Research · doi:10.1287/opre.11.3.399 · Cited by 1,274
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
Linear complementarity, linear and nonlinear programming
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90500-6 · Cited by 978
On the maximality of sums of nonlinear monotone operators
Rockafellar, R. T. (1970) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1970-0282272-5 · Cited by 949
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
Passty, G. B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90234-8 · Cited by 609
Studies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
An introduction to Hilbert space
(1989) · Choice Reviews Online · doi:10.5860/choice.26-3315 · Cited by 484
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
Gabay, D. (1983) · Studies in mathematics and its applications · doi:10.1016/s0168-2024(08)70034-1 · Cited by 422
An Introduction to Hilbert Space
Young, N. (1988) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172011 · Cited by 330
Solution of symmetric linear complementarity problems by iterative methods
Mangasarian, O. L. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf01268170 · Cited by 327
Iterative methods for variational and complementarity problems
Pang, J., & Chan, D. (1982) · Mathematical Programming · doi:10.1007/bf01585112 · Cited by 305
An iterative scheme for variational inequalities
Dafermos, S. C. (1983) · Mathematical Programming · doi:10.1007/bf02591891 · Cited by 278
On the monotonicity of the gradient of a convex function
Minty, G. (1964) · Pacific Journal of Mathematics · doi:10.2140/pjm.1964.14.243 · Cited by 205
Bruck, R. E. (1977) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(77)90152-4 · Cited by 166
Applications of the method of partial inverses to convex programming: Decomposition
Spingarn, J. E. (1985) · Mathematical Programming · doi:10.1007/bf01586091 · Cited by 151
Iterative Methods for Large Convex Quadratic Programs: A Survey
Lin, Y., & Pang, J. (1987) · SIAM Journal on Control and Optimization · doi:10.1137/0325023 · Cited by 123
An iterative solution of a variational inequality for certain monotone operators in Hilbert space
Bruck, R. E. (1975) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1975-13874-2 · Cited by 94
Sur la stabilité et la convergence de la méthode des pas fractionnaires
Témam, R. (1968) · Annali di Matematica Pura ed Applicata (1923 -) · doi:10.1007/bf02415183 · Cited by 74
Coupling optimization methods and variational convergence
Lemaire, B. (1988) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9297-1_12 · Cited by 62
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
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.