Distributed nonconvex multiagent optimization over time-varying networks
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA) techniques coupled with i) a tracking mechanism instrumental to locally estimate the gradients of agents' cost functions; and ii) a novel broadcast protocol to disseminate information and distribute the computation among the agents. Asymptotic convergence to stationary solutions is established. A key feature of the proposed algorithm is that it neither requires the double-stochasticity of the consensus matrices (but only column stochasticity) nor the knowledge of the graph sequence to implement. To the best of our knowledge, the proposed framework is the first broadcast-based distributed algorithm for convex and nonconvex constrained optimization over arbitrary, time-varying digraphs. Numerical results show that our algorithm outperforms current schemes on both convex and nonconvex problems.
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
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 · cited 1×
“Distributed solution methods for convex instances of Problem (1) have been widely studied in the literature, under various assumptions on network topology; some recent contributions include [1]–[8].”
BackgroundWeik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
Distributed Optimization Over Time-Varying Directed Graphs
Nedic, A., & Olshevsky, A. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2364096 · Cited by 1,187
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069 · cited 5×
“In the same technical report [26], the authors proposed pushDIGing, the extension of DIGing to B-strongly connected digraphs.”
BackgroundMethodInfluentialDual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
Cited by
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“Finally, the paper [64] proposed an algorithm with diminishing step-size for nonconvex optimization over directed graphs based on the push-sum method [27] and showed convergence to a stationary point.”
MethodNetwork 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
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
Li, Z., Shi, W., & Yan, M. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2926022 · Cited by 244
Distributed nonconvex constrained optimization over time-varying digraphs
Scutari, G., & Sun, Y. (2019) · Mathematical Programming · doi:10.1007/s10107-018-01357-w · Cited by 210
Self-citationDistributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
Xie, P., You, K., Tempo, R., Song, S., & Wu, C. (2018) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2816104 · Cited by 133
Decentralized Proximal Gradient Algorithms With Linear Convergence Rates
Alghunaim, S. A., Ryu, E. K., Yuan, K., & Sayed, A. H. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3009363 · Cited by 151
Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization
Tian, Y., Sun, Y., & Scutari, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.2977940 · Cited by 120
Self-citationFROST—Fast row-stochastic optimization with uncoordinated step-sizes
Xin, R., Xi, C., & Khan, U. A. (2019) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-018-0596-y · Cited by 122
Distributed Optimization for Smart Cyber-Physical Networks
Notarstefano, G., Notarnicola, I., & Camisa, A. (2019) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000020 · Cited by 122
AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
Zhang, J., & You, K. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2930234 · Cited by 94
Sun, Y., Scutari, G., & Daneshmand, A. (2022) · SIAM Journal on Optimization · doi:10.1137/19m1259973 · Cited by 155
Self-citationParallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization
Scutari, G., & Sun, Y. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_3 · Cited by 121
Self-citationZONE: Zeroth-Order Nonconvex Multiagent Optimization Over Networks
Hajinezhad, D., Hong, M., & Garcia, A. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2896025 · Cited by 137
Perturbed proximal primal–dual algorithm for nonconvex nonsmooth optimization
Hajinezhad, D., & Hong, M. (2019) · Mathematical Programming · doi:10.1007/s10107-019-01365-4 · Cited by 62
Second-Order Guarantees of Distributed Gradient Algorithms
Daneshmand, A., Scutari, G., & Kungurtsev, V. (2020) · SIAM Journal on Optimization · doi:10.1137/18m121784x · Cited by 68
Self-citationDistributed Nesterov Gradient and Heavy-Ball Double Accelerated Asynchronous Optimization
Li, H., Cheng, H., Wang, Z., & Wu, G. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3027381 · Cited by 62
A Fast Distributed Asynchronous Newton-Based Optimization Algorithm
Mansoori, F., & Wei, E. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2019.2933607 · Cited by 60
ASY-SONATA: Achieving Linear Convergence in Distributed Asynchronous Multiagent Optimization
Tian, Y., Sun, Y., & Scutari, G. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636055 · Cited by 39
Self-citationZeroth Order Nonconvex Multi-Agent Optimization over NetworksPreprint
Hajinezhad, D., Hong, M., & García, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.09997 · Cited by 35
A distributed asynchronous method of multipliers for constrained nonconvex optimization
Farina, F., Garulli, A., Giannitrapani, A., & Notarstefano, G. (2019) · Automatica · doi:10.1016/j.automatica.2019.02.003 · Cited by 37
Olshevsky, A., Paschalidis, I. C., & Spiridonoff, A. (2018) · arXiv (Cornell University) · Cited by 31
Network flows that solve least squares for linear equations
Liu, Y., Lou, Y., Anderson, B. D. O., & Shi, G. (2020) · Automatica · doi:10.1016/j.automatica.2020.109108 · Cited by 28
Maros, M., & Jaldén, J. (2018) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2018.8619626 · Cited by 34
Communication-Censored Linearized ADMM for Decentralized Consensus Optimization
Li, W., Liu, Y., Tian, Z., & Ling, Q. H. (2019) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2019.2957719 · Cited by 35
A Case of Distributed Optimization in Adversarial Environment
Ravi, N., Scaglione, A., & Nedić, A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8683442 · Cited by 32
Distributed data clustering over networks
Altilio, R., Lorenzo, P. D., & Panella, M. (2019) · Pattern Recognition · doi:10.1016/j.patcog.2019.04.021 · Cited by 31
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.02818 · Cited by 42
A framework for parallel and distributed training of neural networks
Scardapane, S., & Lorenzo, P. D. (2017) · Neural Networks · doi:10.1016/j.neunet.2017.04.004 · Cited by 25
Distributed Big-Data Optimization via Blockwise Gradient Tracking
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008713 · Cited by 26
Self-citationDecentralized Submodular Maximization: Bridging Discrete and Continuous SettingsPreprint
Mokhtari, A., Hassani, H., & Karbasi, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.03825 · Cited by 36
A Gradient Tracking Protocol for Optimization Over Nabla Fractional Multi-Agent Systems
Zhou, S., Wei, Y., Liang, S., & Cao, J. (2024) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2024.3402354 · Cited by 24
Distributed nonconvex optimization for sparse representation
Sun, Y., & Scutari, G. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952916 · Cited by 18
Self-citationRandom Sleep Scheme-Based Distributed Optimization Algorithm Over Unbalanced Time-Varying Networks
Li, H., Wang, Z., Xia, D., & Han, Q. (2019) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2019.2945864 · Cited by 17
A Geometrically Converging Dual Method for Distributed Optimization Over Time-Varying Graphs
Maros, M., & Jaldén, J. (2020) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3018743 · Cited by 21
An efficient parallel and distributed solution to nonconvex penalized linear SVMs
Guan, L., Sun, T., Qiao, L.-B., Yang, Z.-H., Li, D.-S., Ge, K.-S., & Lu, X.-C. (2019) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1800566 · Cited by 12
A Distributed Nesterov-Like Gradient Tracking Algorithm for Composite Constrained Optimization
Zheng, L., Li, H., Li, J. Q., Wang, Z., Lü, Q., Shi, Y., Wang, H., Dong, T., Ji, L., & Xia, D. (2023) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2023.3239698 · Cited by 17
Distributed big-data optimization via block-iterative convexification and averaging
Notarnicola, I., Sun, Y., Scutari, G., & Notarstefano, G. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8263982 · Cited by 18
Self-citationDistributed Gradient Descent: Nonconvergence to Saddle Points and the Stable-Manifold Theorem
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919658 · Cited by 18
Stochastic Training of Neural Networks via Successive Convex Approximations
Scardapane, S., & Lorenzo, P. D. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2785361 · Cited by 11
Second-order Guarantees of Gradient Algorithms over Networks
Daneshmand, A., Scutari, G., & Kungurtsev, V. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636044 · Cited by 13
Self-citationDistributed mechanism design with learning guarantees
Sinha, A., & Anastasopoulos, A. (2017) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2017.8264399 · Cited by 12
ASY-SONATA: Achieving Geometric Convergence for Distributed Asynchronous Optimization.
Tian, Y., Sun, Y., Du, B., & Scutari, G. (2018) · Cited by 14
Self-citationDistributed Optimization Over Networks
Nedić, A. (2018) · Lecture notes in mathematics · doi:10.1007/978-3-319-97142-1_1 · Cited by 13
Decentralized Stochastic Non-Convex Optimization over Weakly Connected Time-Varying Digraphs
Lu, S., & Wu, C. W. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053238 · Cited by 20
Distributed Gradient Flow: Nonsmoothness, Nonconvexity, and Saddle Point Evasion
Swenson, B., Murray, R., Poor, H. V., & Kar, S. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3111853 · Cited by 14
Stochastic learning in multi-agent optimization: Communication and payoff-based approaches
Tatarenko, T. (2018) · Automatica · doi:10.1016/j.automatica.2018.10.001 · Cited by 13
Distributed Optimization of Convex Sum of Non-Convex FunctionsPreprint
Gade, S., & Vaidya, N. H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1608.05401 · Cited by 14
Regularized Diffusion Adaptation via Conjugate Smoothing
Vlaski, S., Vandenberghe, L., & Sayed, A. H. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2021.3081073 · Cited by 9
On Distributed Stochastic Gradient Algorithms for Global Optimization
Swenson, B., Sridhar, A., & Poor, H. V. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054279 · Cited by 11
Hamedani, E. Y., & Aybat, N. S. (2017) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2017.8262781 · Cited by 11
A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
Pang, Y., & Hu, G. (2022) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.6266 · Cited by 8
An Empirical Bayes Approach for Distributed Estimation of Spatial Fields
Sasso, F., Coluccia, A., & Notarstefano, G. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550231 · Cited by 8
Distributed Stochastic Gradient Descent and Convergence to Local MinimaPreprint
Swenson, B., Murray, R., Kar, S., & Poor, H. V. (2020) · arXiv (Cornell University) · Cited by 9
Decentralized Convex Optimization over Time-Varying Graphs
Rogozin, A., Gasnikov, A. V., Beznosikov, A., & Kovalev, D. A. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_860-1 · Cited by 7
On Consensus-Disagreement Tradeoff in Distributed Optimization
Jiang, Z., Mukherjee, K., & Sarkar, S. (2018) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.23919/acc.2018.8430883 · Cited by 7
Decentralized Dictionary Learning Over Time-Varying DigraphsPreprint
Daneshmand, A., Sun, Y., Scutari, G., Facchinei, F., & Sadler, B. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.05933 · Cited by 8
Self-citationDistributed Global Optimization by Annealing
Swenson, B., Kart, S., Poor, H. V., & Moura, J. M. F. (2019) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap45676.2019.9022513 · Cited by 5
Clustering with Distributed DataPreprint
Kar, S., & Swenson, B. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.00214 · Cited by 9
Taming Subnet-Drift in D2D-Enabled Fog Learning: A Hierarchical Gradient Tracking Approach
Chen, E., Wang, S., & Brinton, C. G. (2024) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom52122.2024.10621133 · Cited by 12
Asynchronous Distributed Method of Multipliers for Constrained Nonconvex optimization
Farina, F., Garulli, A., Giannitrapani, A., & Notarstefano, G. (2018) · European Control Conference (ECC) · doi:10.23919/ecc.2018.8550098 · Cited by 6
Localization of Data Injection Attacks on Distributed M-Estimation
Shalom, O. O., Leshem, A., & Scaglione, A. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3188450 · Cited by 6
On the Linear Convergence of Two Decentralized Algorithms
Li, Y., & Yan, M. (2021) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-021-01833-y · Cited by 9
Linearly Convergent Second-Order Distributed Optimization Algorithms
Qu, Z., Li, X., Li, L., & Hong, Y. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3360287 · Cited by 4
D2L: Decentralized dictionary learning over dynamic networks
Daneshmand, A., Sun, Y., Scutari, G., & Facchinei, F. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952924 · Cited by 3
Self-citationRen, J., & Haupt, J. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2996374 · Cited by 5
Ran, L., Li, H., Zheng, L., & Li, J. Q. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3437249 · Cited by 4
Napier, S. W., McMahon, J. W., & Englander, J. A. (2020) · The Journal of the Astronautical Sciences · doi:10.1007/s40295-020-00215-2 · Cited by 2
Sparse High-Order Portfolios Via Proximal Dca And Sca
Wang, J., Deng, Z., Zheng, T., & So, A. M. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9414048 · Cited by 2
Distributed empirical risk minimization over directed graphs
Xin, R., Sahu, A. K., Kar, S., & Khan, U. A. (2019) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf44664.2019.9049065 · Cited by 3
Stochastic Learning in Potential Games: Communication and Payoff-Based ApproachesPreprint
Tatarenko, T. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.04403 · Cited by 2
Ranjan, P., Tripathy, M. R., Pushp, S., & Pushp, S. (2017) · Photonics & Electromagnetics Research Symposium - Spring (PIERS-Spring) · doi:10.1109/piers.2017.8261794 · Cited by 1
An Accelerated Asynchronous Distributed Method for Convex Constrained Optimization Problems
Abolfazli, N., Jalilzadeh, A., & Hamedani, E. Y. (2023) · Conference on Information Sciences and Systems · doi:10.1109/ciss56502.2023.10089633 · Cited by 1
Linear Convergence of Asynchronous Gradient Push Algorithm for Distributed Optimization
Li, H., Cheng, H., Lü, Q., Wang, Z., & Huang, T. (2024) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2024.3516936 · Cited by 3
Random Sleep Scheme-Based Distributed Optimization over Time-Varying Directed Networks
Li, H., Lü, Q., Wang, Z., Liao, X., & Huang, T. (2020) · Springer eBooks · doi:10.1007/978-981-15-6109-2_7 · Cited by 1
On linear convergence of two decentralized algorithmsPreprint
Li, Y., & Yan, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.07225 · Cited by 1
Distributed Mechanism Design with Learning GuaranteesPreprint
Sinha, A., & Anastasopoulos, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.05641 · Cited by 1
Decentralized convex optimization over time-varying graphs: a surveyPreprint
Rogozin, A., Gasnikov, A. V., Beznosikov, A., & Kovalev, D. A. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.09719 · Cited by 8
Distributed Constrained Nonconvex Optimization: the Asynchronous Method of MultipliersPreprint
Farina, F., Garulli, A., Giannitrapani, A., & Notarstefano, G. (2018) · arXiv (Cornell University)
A Prototype Towards Modeling Visual Data Using Decentralized Generative Adversarial Networks
Kosmopoulos, D. (2018) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2018.8451471
Distributed Primal-Dual Proximal Method for Regularized Empirical Risk Minimization
Khuzani, M. B. (2018) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2018.00152
Gradient-Free Multi-Agent Nonconvex Nonsmooth OptimizationPreprint
Hajinezhad, D., & Zavlanos, M. M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.04650
Asynchronous Algorithms in Distributed Optimization Over Multi-Agent Network
You, K., & Du, Y. (2024) · Elsevier eBooks · doi:10.1016/b978-0-443-14081-5.00084-2
An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
Choi, H., Choi, W., & Kim, G. (2026) · Computational Optimization and Applications · doi:10.1007/s10589-025-00763-z · Cited by 1
A Hierarchical Gradient Tracking Algorithm for Mitigating Subnet-Drift in Fog Learning Networks
Chen, E., Wang, S., & Brinton, C. G. (2026) · IEEE Transactions on Networking · doi:10.1109/ton.2026.3673208
Direct-search methods for decentralized blackbox optimization
Bergou, E. H., Diouane, Y., Kungurtsev, V., & Royer, C. W. (2026) · Optimization methods & software · doi:10.1080/10556788.2026.2643878 · Cited by 1
Accelerated distributed online aggregative optimization over unbalanced digraphs
Fang, J. (2026) · Transactions of the Institute of Measurement and Control · doi:10.1177/01423312261460541
Metadata
- Authors
- Sun, Y., Scutari, G., & Palomar, D.
- Affiliations
- Purdue University West Lafayette (US)
- Hong Kong University of Science and Technology (HK)
- Venue
- 2016 50th Asilomar Conference on Signals, Systems and Computers
- Publisher
- IEEE
- Published
- 2016-11
- Pages
- 788-794
- ISSN
- 1058-6393 (ISSN-L)
- OpenAlex
- W2963090384
- Cited by
- 86
- References
- 30
- Citations by year
- 2026: 4 · 2024: 6 · 2023: 3 · 2022: 4 · 2021: 4 · 2020: 14 · 2019: 20 · 2018: 21 · 2017: 9 · 2016: 1
- FWCI
- 14.52
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Asilomar Conference on Signals, Systems and Computers (ACSSC) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1555850, 1564044, CAREER)
- Office of Naval Research (N00014-16-1-2244, N00014)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Engineering › Control and Systems Engineering › Advanced Control Systems Optimization
- Keywords
- distributed optimization, non-convex optimization, multi-agent systems, successive convex approximation, gradient tracking, constrained optimization, convergence to stationary solutions
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.