The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Open accessAbstract
Various distributed optimization methods have been developed for solving problems which have simple local constraint sets and whose objective function is the sum of local cost functions of distributed agents in a network. Motivated by emerging applications in smart grid and distributed sparse regression, this paper studies distributed optimization methods for solving general problems which have a coupled global cost function and have inequality constraints. We consider a network scenario where each agent has no global knowledge and can access only its local mapping and constraint functions. To solve this problem in a distributed manner, we propose a consensus-based distributed primal-dual perturbation (PDP) algorithm. In the algorithm, agents employ the average consensus technique to estimate the global cost and constraint functions via exchanging messages with neighbors, and meanwhile use a local primal-dual perturbed subgradient method to approach a global optimum. The proposed PDP method not only can handle smooth inequality constraints but also non-smooth constraints such as some sparsity promoting constraints arising in sparse optimization. We prove that the proposed PDP algorithm converges to an optimal primal-dual solution of the original problem, under standard problem and network assumptions. Numerical results illustrating the performance of the proposed algorithm for a distributed demand response control problem in smart grid are also presented.
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
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
John Lu, Z. Q. (2010) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2010.00646_6.x · Cited by 12,390
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
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
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
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Self-citationSparse and Redundant Representations: From Theory to Applications in Signal and Image Processing
Elad, M. (2010) · doi:10.1007/978-1-4419-7011-4 · Cited by 1,897
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Network Optimization: Continuous and Discrete Models
Bertsekas, D. P. (1998) · Cited by 1,027
Optimal demand response based on utility maximization in power networks
Li, N., Chen, L., & Low, S. H. (2011) · 2011 IEEE Power and Energy Society General Meeting · doi:10.1109/pes.2011.6039082 · Cited by 941
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901 · cited 1×
“D ISTRIBUTED optimization methods are becoming popular options for solving several engineering problems, including parameter estimation, detection and localization problems in sensor networks [1], [2], resource allocation problems in peer-to-peer/multi-cellular communication networks [3], [4], and distributed learning…”
MethodDistributed Stochastic Subgradient Projection Algorithms for Convex Optimization
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2010) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9737-7 · Cited by 814
Self-citationOn Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
Chen, J., & Sayed, A. H. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2198470 · Cited by 680
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
Subgradient Methods for Saddle-Point Problems
Nedić, A., & Ozdaglar, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9522-7 · Cited by 438
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
Nedić, A., & Ozdaglar, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070708111 · Cited by 399
Power Control in Wireless Cellular Networks
Chiang, M., Hande, P., Lan, T., & Tan, C. W. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981370 · Cited by 361
Distributed algorithms for maximum lifetime routing in wireless sensor networks
Madan, R., & Lall, S. (2006) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2006.1687734 · Cited by 357
Distributed Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351
Subgradient methods and consensus algorithms for solving convex optimization problems
Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2008) · 2008 47th IEEE Conference on Decision and Control · doi:10.1109/cdc.2008.4739339 · Cited by 316
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Lustig, I. J., Marsten, R. E., & Shanno, D. F. (1994) · INFORMS journal on computing · doi:10.1287/ijoc.6.1.1 · Cited by 315
Asynchronous Broadcast-Based Convex Optimization Over a Network
Nedic, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2079650 · Cited by 310
Power Control in Wireless Cellular Networks
Chiang, M., Hande, P., Lan, T., & Tan, C. W. (2008) · Foundations and Trends in Networking · doi:10.1561/1300000009 · Cited by 304
Distributed Sensor Networks: A Multiagent Perspective
Lesser, V., Tambe, M., & Ortiz, C. L. (2003) · Kluwer Academic Publishers eBooks · Cited by 289
Distributed Robust Multicell Coordinated Beamforming With Imperfect CSI: An ADMM Approach
Shen, C., Chang, T.-H., Wang, K.-Y., Qiu, Z., & Chi, C.-Y. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2188719 · Cited by 282
Self-citationDistributed Primal–Dual Subgradient Method for Multiagent Optimization via Consensus Algorithms
Yuan, D., Xu, S., & Zhao, H. (2011) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2160394 · Cited by 255
Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2182347 · Cited by 210
Convergence Rates in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2006.376899 · Cited by 169
Real-Time Power Balancing Via Decentralized Coordinated Home Energy Scheduling
Chang, T., Alizadeh, M., & Scaglione, A. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2013.2250532 · Cited by 160
Self-citationA new class of distributed optimization algorithms: Application to regression of distributed data
Sundhar Ram, S., Nedić, A., & Veeravalli, V. V. (2012) · Optimization Methods and Software · doi:10.1080/10556788.2010.511669 · Cited by 123
Demand-Side Management in the Smart Grid: Information Processing for the Power Switch
Alizadeh, M., Li, X., Wang, Z., Scaglione, A., & Melton, R. B. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2192951 · Cited by 116
Self-citationAsynchronous gossip algorithms for stochastic optimization
Ram, S. S., Nedić, A., & Veeravalli, V. V. (2009) · International Conference on Game Theory for Networks · doi:10.1109/gamenets.2009.5137386 · Cited by 94
Distributed Optimization and Games: A Tutorial Overview
Yang, B., & Johansson, M. (2010) · Lecture notes in control and information sciences · doi:10.1007/978-0-85729-033-5_4 · Cited by 88
An Adaptive Projected Subgradient Approach to Learning in Diffusion Networks
Cavalcante, R. L. G., Yamada, I., & Mulgrew, B. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2018648 · Cited by 69
Coordinated home energy management for real-time power balancing
Chang, T., Alizadeh, M., & Scaglione, A. (2012) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesgm.2012.6345639 · Cited by 54
Self-citationDistributed Multivariate Regression Using Wavelet-Based Collective Data Mining
Hershberger, D. E., & Kargupta, H. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2000.1694 · Cited by 51
Distributed Bregman-Distance Algorithms for Min-Max Optimization
Srivastava, K., Nedić, A., & Stipanović, D. M. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-34097-0_7 · Cited by 34
Perturbation Methods for Saddle Point Computation
Kallio, M., & Ruszczyński, A. (1994) · IIASA PURE (International Institute of Applied Systems Analysis) · Cited by 18
Cited by
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
Self-citationMulti-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Self-citationA Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
Yang, S., Liu, Q., & Wang, J. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2610945 · Cited by 314
Distributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
Metadata
- Authors
- Chang, T.-H., Nedic, A., & Scaglione, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-06
- Volume
- 59
- Issue
- 6
- Pages
- 1524-1538
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2155356457
- Cited by
- 401
- References
- 43
- FWCI
- 45.07
- 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.