The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Abstract
The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated. Rate-of-convergence results for the “method of multipliers,” of the strong sort already known, are derived in a generalized form relevant also to problems beyond the compass of the standard second-order conditions for oplimality. The new algorithm, the “proximal method of multipliers,” is shown to have much the same convergence properties, but with some potential advantages.
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
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
Self-citationMultiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
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
Self-citationOn the maximal monotonicity of subdifferential mappings
Rockafellar, R. (1970) · Pacific Journal of Mathematics · doi:10.2140/pjm.1970.33.209 · Cited by 740
Self-citationThe multiplier method of Hestenes and Powell applied to convex programming
Rockafellar, R. T. (1973) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934777 · Cited by 705
Self-citationAugmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
Rockafellar, R. T. (1974) · SIAM Journal on Control · doi:10.1137/0312021 · Cited by 587
Self-citationA dual approach to solving nonlinear programming problems by unconstrained optimization
Rockafellar, R. T. (1973) · Mathematical Programming · doi:10.1007/bf01580138 · Cited by 443
Self-citationCombined Primal–Dual and Penalty Methods for Convex Programming
Kort, B., & Bertsekas, D. P. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314020 · Cited by 95
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
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
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
Self-citationEckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization
Tseng, P. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017501703105 · Cited by 1,989
Harker, P. T., & Pang, J.-S. (1990) · Mathematical Programming · doi:10.1007/bf01582255 · Cited by 1,817
Scenarios and Policy Aggregation in Optimization Under Uncertainty
Rockafellar, R. T., & Wets, R. J.-B. (1991) · Mathematics of Operations Research · doi:10.1287/moor.16.1.119 · Cited by 1,340
Self-citationA 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
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
A mixed formulation for frictional contact problems prone to Newton like solution methods
Alart, P., & Curnier, A. (1991) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/0045-7825(91)90022-x · Cited by 758
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
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Güler, O. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329022 · Cited by 681
Simultaneous Routing and Resource Allocation Via Dual Decomposition
Xiao, L., Johansson, M., & Boyd, S. P. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.831346 · Cited by 561
An Augmented Lagrangian Method for Total Variation Video Restoration
Chan, S. H., Khoshabeh, R., Gibson, K. B., Gill, P. E., & Nguyen, T. Q. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2158229 · Cited by 488
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Solving monotone inclusions via compositions of nonexpansive averaged operators
Combettes *, P. L. (2004) · Optimization · doi:10.1080/02331930412331327157 · Cited by 457
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Chen, G., & Teboulle, M. (1993) · SIAM Journal on Optimization · doi:10.1137/0803026 · Cited by 428
Error bounds and convergence analysis of feasible descent methods: a general approach
Luo, Z.-Q., & Tseng, P. (1993) · Annals of Operations Research · doi:10.1007/bf02096261 · Cited by 420
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Zhang, X., Burger, M., & Osher, S. (2011) · Journal of Scientific Computing · doi:10.1007/s10915-010-9408-8 · Cited by 419
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Eckstein, J. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.1.202 · Cited by 324
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
Self-citationSample-path solution of stochastic variational inequalities
Gürkan, G., Yonca Özge, A., & Robinson, S. M. (1999) · Mathematical Programming · doi:10.1007/s101070050024 · Cited by 271
Proximal minimization algorithm withD-functions
Censor, Y., & Zenios, S. A. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940051 · Cited by 268
Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
Jakovetic, D., Moura, J. M. F., & Xavier, J. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2363299 · Cited by 123
Metadata
- Authors
- Rockafellar, R. T.
- Venue
- Mathematics of Operations Research
- Published
- 1976-05
- Volume
- 1
- Issue
- 2
- Pages
- 97-116
- ISSN
- 0364-765X (ISSN-L)
- 1526-5471
- OpenAlex
- W2135779729
- Cited by
- 1,175
- References
- 8
- FWCI
- 3.22
- 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.