The DOI matches its Crossref record; 163 of the 163 references it cites were found in a registry or an index.
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Abstract
Many problems of recent interest in statistics and machine learning can be posed in the framework of convex optimization. Due to the explosion in size and complexity of modern datasets, it is increasingly important to be able to solve problems with a very large number of features or training examples. As a result, both the decentralized collection or storage of these datasets as well as accompanying distributed solution methods are either necessary or at least highly desirable. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers argues that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas. The method was developed in the 1970s, with roots in the 1950s, and is equivalent or closely related to many other algorithms, such as dual decomposition, the method of multipliers, Douglas-Rachford splitting, Spingarn's method of partial inverses, Dykstra's alternating projections, Bregman iterative algorithms for ?1 problems, proximal methods, and others. After briefly surveying the theory and history of the algorithm, it discusses applications to a wide variety of statistical and machine learning problems of recent interest, including the lasso, sparse logistic regression, basis pursuit, covariance selection, support vector machines, and many others. It also discusses general distributed optimization, extensions to the nonconvex setting, and efficient implementation, including some details on distributed MPI and Hadoop MapReduce implementations.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationRegression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
(2005) · Statistics for Biology and Health · doi:10.1007/0-387-27255-0_9 · Cited by 20,133
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Donoho, D. L. (2004) · Cited by 16,703
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Brown, R. A., Hastie, T. J., & Tibshirani, R. J. (1991) · Biometrics · doi:10.2307/2532174 · Cited by 8,176
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Robust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
(2009) · Cited by 6,153
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
(2010) · Cited by 4,411
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
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
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Bigtable: A Distributed Storage System for Structured Data
Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chandra, T., Fikes, A., & Gruber, R. E. (2008) · ACM Transactions on Computer Systems · doi:10.1145/1365815.1365816 · Cited by 3,460
The Numerical Solution of Parabolic and Elliptic Differential Equations
Peaceman, D. W., & Rachford, Jr. (1955) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0103003 · Cited by 3,255
Hastie, T., & Tibshirani, R. (2014) · Wiley StatsRef: Statistics Reference Online · doi:10.1002/9781118445112.stat03141 · Cited by 3,156
Existence of an equilibrium for a competitive economy
Arrow, K. J., Debreu, G., Debreu, G., & Hildenbrand, W. (2008) · Mathematical Economics · doi:10.1017/ccol052123736x.005 · Cited by 3,041
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
White, T. (2009) · Cited by 2,800
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Self-citationSignal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Operateurs Maximaux Monotones - Et Semi-Groupes De Contractions Dans Les Espaces De Hilbert
(1973) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)x7125-7 · Cited by 2,578
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
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
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Decomposition Principle for Linear Programs
Dantzig, G. B., & Wolfe, P. (1960) · Operations Research · doi:10.1287/opre.8.1.101 · Cited by 2,315
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
A high-performance, portable implementation of the MPI message passing interface standard
Gropp, W., Lusk, E., Doss, N., & Skjellum, A. (1996) · Parallel Computing · doi:10.1016/0167-8191(96)00024-5 · Cited by 2,222
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Self-citationStoer, J. (1999) · Springer-Lehrbuch · doi:10.1007/978-3-662-09021-3 · Cited by 2,059
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
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
The Unreasonable Effectiveness of Data
Halevy, A., Norvig, P., & Pereira, F. (2009) · IEEE Intelligent Systems · doi:10.1109/mis.2009.36 · Cited by 1,767
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
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
On Projection Algorithms for Solving Convex Feasibility Problems
Bauschke, H. H., & Borwein, J. M. (1996) · SIAM Review · doi:10.1137/s0036144593251710 · Cited by 1,654
Basic Linear Algebra Subprograms for Fortran Usage
Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355847 · Cited by 1,634
Minimization Methods for Non-Differentiable Functions
Shor, N. Z. (1985) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-82118-9 · Cited by 1,551
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Fundamentals of Convex Analysis
Hiriart-Urruty, J.-B., & Lemaréchal, C. (2001) · Springer eBooks · doi:10.1007/978-3-642-56468-0 · Cited by 1,402
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
PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION
Τσιτσικλής, Ι. (2014) · doi:10.12681/eadd/3778 · Cited by 1,278
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
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
Map-Reduce for Machine Learning on Multicore
Chu, C.-T., Kim, S. K., Lin, Y.-A., Yu, Y., Bradski, G., Ng, A. Y., & Olukotun, K. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0040 · Cited by 1,229
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
Fast Image Recovery Using Variable Splitting and Constrained Optimization
Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2047910 · Cited by 1,223
Alternating 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
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
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (2005) · Computational Management Science · doi:10.1007/s10287-004-0020-y · Cited by 837
Robust Modeling With Erratic Data
Claerbout, J. F., & Muir, F. (1973) · Geophysics · doi:10.1190/1.1440378 · Cited by 833
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
Afonso, M. V., Bioucas‐Dias, J. M., & Figueiredo, M. A. T. (2011) · Cited by 783
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
(1983) · Studies in Mathematics and Its Applications · doi:10.1016/s0168-2024(08)x7003-1 · Cited by 760
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Statistical behavior and consistency of classification methods based on convex risk minimization
Zhang, T. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120130 · Cited by 711
HaLoop: efficient iterative data processing on large clusters
Bu, Y., Howe, B., Balazinska, M., & Ernst, M. D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920881 · Cited by 693
Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
Schizas, I. D., Ribeiro, A., & Giannakis, G. B. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.906734 · Cited by 685
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2010) · 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing · doi:10.1109/whispers.2010.5594963 · Cited by 658
Nordhausen, K. (2009) · International Statistical Review · doi:10.1111/j.1751-5823.2009.00095_18.x · Cited by 637
The composite absolute penalties family for grouped and hierarchical variable selection
Zhao, P., Rocha, G., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos584 · Cited by 631
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Self-citationAn Algorithm for Restricted Least Squares Regression
Dykstra, R. L. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477029 · Cited by 551
Distributed Sparse Linear Regression
Mateos, G., Bazerque, J. A., & Giannakis, G. B. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2055862 · Cited by 550
An Interior-Point Method for Large-Scale '1-Regularized Logistic Regression
Koh, K., Kim, S.-J., & Boyd, S. (2007) · Cited by 549
Self-citationFonctions convexes duales et points proximaux dans un espace hilbertien
Moreau, J. J. (1962) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 501
The Convex Feasibility Problem in Image Recovery
Combettes, P. L. (1996) · Advances in Imaging and Electron Physics · doi:10.1016/s1076-5670(08)70157-5 · Cited by 490
A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Near-ideal model selection by ℓ1 minimization
Candès, E. J., & Plan, Y. (2008) · Cited by 469
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
He, B. S., Yang, H., & Wang, S. L. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1004603514434 · Cited by 465
LAPACK: A Portable Linear Algebra Library for High-Performance Computers
Anderson, E., Bai, Z., Bischof, C. H., Demmel, J. W., Dongarra, J. J., Croz, J. D., Greenbaum, A., Hammarling, S. J., McKenney, A., & Sorensen, D. C. (1990) · Cited by 428
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
Consensus-based distributed support vector machines
Forero, P. A., Caño, A., & Giannakis, G. B. (2010) · Cited by 364
Studies in Linear and Nonlinear Programming
Kunzi, H. P., Arrow, J. K., Hurwicz, L., & Uzawa, H. (1963) · Econometrica · doi:10.2307/1910003 · Cited by 337
Restoration of Poissonian images using alternating direction optimization
Figueiredo, M. A. T., & Bioucas‐Dias, J. M. (2010) · Cited by 325
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
Proximity maps for convex sets
Cheney, W., & Goldstein, A. A. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0105008-8 · Cited by 302
Removing Multiplicative Noise by Douglas-Rachford Splitting Methods
Steidl, G., & Teuber, T. (2010) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-009-0179-5 · Cited by 287
Proximal minimization algorithm withD-functions
Censor, Y., & Zenios, S. A. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940051 · Cited by 268
Ng, M. K., Weiss, P., & Yuan, X. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090774823 · Cited by 266
Splitting methods for monotone operators with applications to parallel optimization
Eckstein, J. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 250
Fukushima, M. (1992) · Computational Optimization and Applications · doi:10.1007/bf00247655 · Cited by 227
Bundle Methods for Regularized Risk Minimization
Teo, C. H., Vishwanthan, S. V. N., Smola, A. J., & Le, Q. V. (2010) · doi:10.5555/1756006.1756016 · Cited by 223
Schizas, I. D., Giannakis, G. B., Roumeliotis, S. I., & Ribeiro, A. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.908943 · Cited by 192
Cooperative distributed multi-agent optimization
Nedić, A., & Ozdaglar, A. (2009) · Convex Optimization in Signal Processing and Communications · doi:10.1017/cbo9780511804458.011 · Cited by 185
Dykstra′s Alternating Projection Algorithm for Two Sets
Bauschke, H. H., & Borwein, J. M. (1994) · Journal of Approximation Theory · doi:10.1006/jath.1994.1136 · Cited by 181
Proximal Splitting Methods in Signal ProcessingPreprint
Combettes, P. L., & Pesquet, J.-C. (2009) · doi:10.48550/arxiv.0912.3522 · Cited by 169
Design patterns for efficient graph algorithms in MapReduce
Lin, J., & Schatz, M. (2010) · Proceedings of the Eighth Workshop on Mining and Learning with Graphs · doi:10.1145/1830252.1830263 · Cited by 167
Application of a Smoothing Technique to Decomposition in Convex Optimization
Necoara, I., & Suykens, J. A. K. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2007159 · Cited by 161
Kalman Filtering in Wireless Sensor Networks
Ribeiro, A., Schizas, I. D., Roumeliotis, S. I., & Giannakis, G. B. (2010) · IEEE Control Systems · doi:10.1109/mcs.2009.935569 · Cited by 155
Parallel alternating direction multiplier decomposition of convex programs
Eckstein, J. (1994) · Journal of Optimization Theory and Applications · doi:10.1007/bf02196592 · Cited by 152
Applications of the method of partial inverses to convex programming: Decomposition
Spingarn, J. E. (1985) · Mathematical Programming · doi:10.1007/bf01586091 · Cited by 151
Walras' Tatonnement in the Theory of Exchange
Uzawa, H. (1960) · The Review of Economic Studies · doi:10.2307/2296080 · Cited by 149
Network Flow Algorithms for Structured SparsityPreprint
Mairal, J., Jenatton, R., Obozinski, G., & Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.5209 · Cited by 148
A variable-penalty alternating directions method for convex optimization
Kontogiorgis, S. A., & Meyer, R. R. (1998) · Mathematical Programming · doi:10.1007/bf02680549 · Cited by 144
On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
Ruszczyński, A. (1995) · Mathematics of Operations Research · doi:10.1287/moor.20.3.634 · Cited by 143
Some Saddle-function splitting methods for convex programming
Eckstein, J. (1994) · Optimization methods & software · doi:10.1080/10556789408805578 · Cited by 142
Segmentation of ARX-models using sum-of-norms regularization
Ohlsson, H., Lennart Ljung, A., & Boyd, S. (2010) · Automatica · doi:10.1016/j.automatica.2010.03.013 · Cited by 142
Self-citationProjected Subgradient Methods for Learning Sparse GaussiansPreprint
Duchi, J. C., Gould, S. J., & Koller, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.3249 · Cited by 126
A Review of Fast L(1)-Minimization Algorithms for Robust Face Recognition
Yang, A. Y., Genesh, A., Zhou, Z., Sastry, S., & Ma, Y. (2010) · Defense Technical Information Center (DTIC) · doi:10.21236/ada525384 · Cited by 123
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
Tseng, P. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495279797 · Cited by 123
Wang, S. L., & Liao, L. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017522623963 · Cited by 115
An Interior-Point Method for Large-Scale '1-Regularized Logistic Regression
Koh, K., Kim, S.-J., & Boyd, S. (2007) · Cited by 115
Self-citationOn the method of multipliers for mathematical programming problems
Miele, A., Moseley, P. E., Levy, A. V., & Coggins, G. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934960 · Cited by 109
Smooth Optimization Approach for Sparse Covariance Selection
Lu, Z. (2009) · SIAM Journal on Optimization · doi:10.1137/070695915 · Cited by 105
An Augmented Lagrangian Approach to Constrained MAP Inference
Aguiar, P. M. Q., Xing, E. P., Figueiredo, M. A. T., Smith, N. A., & Martins, A. (2011) · International Conference on Machine Learning · Cited by 99
General Projective Splitting Methods for Sums of Maximal Monotone Operators
Eckstein, J., & Svaiter, B. F. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/070698816 · Cited by 94
Eckstein, J., & Ferris, M. C. (1998) · INFORMS journal on computing · doi:10.1287/ijoc.10.2.218 · Cited by 89
A family of projective splitting methods for the sum of two maximal monotone operators
Eckstein, J., & Svaiter, B. F. (2007) · Mathematical Programming · doi:10.1007/s10107-006-0070-8 · Cited by 85
Distributed In-Network Channel Decoding
Zhu, H., Giannakis, G. B., & Cano, A. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2023936 · Cited by 81
Modified Lagrangians in convex programming and their generalizations
Golʹshteĭn, E. G., & Tret’yakov, N. V. (1979) · Mathematical programming studies · doi:10.1007/bfb0120845 · Cited by 79
Use of the augmented penalty function in mathematical programming problems, part 1
Miele, A., Cragg, E. E., Iyer, R. R., & Levy, A. V. (1971) · Journal of Optimization Theory and Applications · doi:10.1007/bf00928472 · Cited by 69
Distributed consensus-based demodulation: algorithms and error analysis
Zhu, H., Caño, A., & Giannakis, G. B. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.06.090890 · Cited by 58
Distributed Dual Averaging In Networks
Agarwal, A., Wainwright, M. J., & Duchi, J. C. (2010) · neural information processing systems · Cited by 55
An augmented Lagrangian decomposition method for block diagonal linear programming problems
Ruszczyński, A. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90055-2 · Cited by 55
Use of the augmented penalty function in mathematical programming problems, part 2
Miele, A., Cragg, E. E., & Levy, A. V. (1971) · Journal of Optimization Theory and Applications · doi:10.1007/bf00928473 · Cited by 46
MapReduce/Bigtable for Distributed Optimization
Hall, K., Gilpin, S., & Mann, G. (2010) · Cited by 44
Fully Distributed Algorithms for Convex Optimization Problems
Mosk-Aoyama, D., Roughgarden, T., & Shah, D. (2010) · SIAM Journal on Optimization · doi:10.1137/080743706 · Cited by 38
On Fixed Points of Non-Expansive Piecewise Isometric Mappings
Lawrence, J., & Spingarn, J. E. (1987) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-55.3.605 · Cited by 34
Market Mechanisms and Mathematical Programming
Uzawa, H. (1960) · Econometrica · doi:10.2307/1907569 · Cited by 23
A practical general approximation criterion for methods of multipliers based on Bregman distances
Eckstein, J. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0374-x · Cited by 16
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Self-citationFederated Optimization in Heterogeneous Networks
Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2018) · arXiv · doi:10.48550/arxiv.1812.06127 · Cited by 4,023
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Deep Convolutional Neural Network for Inverse Problems in Imaging
Jin, K. H., McCann, M. T., Froustey, E., & Unser, M. (2017) · IEEE Transactions on Image Processing · doi:10.1109/tip.2017.2713099 · Cited by 2,529
Learning Deep CNN Denoiser Prior for Image Restoration
Zhang, K., Zuo, W., Gu, S., & Zhang, L. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.300 · Cited by 2,116
Metadata
- Authors
- Boyd, S.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2010
- OpenAlex
- W2164278908
- Cited by
- 12,677
- References
- 163
- FWCI
- 142.38
- Type
- book
- 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.