{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:48:19Z","timestamp":1768715299610,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T00:00:00Z","timestamp":1395705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10898-014-0174-2","type":"journal-article","created":{"date-parts":[[2014,3,23]],"date-time":"2014-03-23T23:16:48Z","timestamp":1395616608000},"page":"325-340","source":"Crossref","is-referenced-by-count":37,"title":["Gradient-free method for nonsmooth distributed optimization"],"prefix":"10.1007","volume":"61","author":[{"given":"Jueyou","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changzhi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyou","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,25]]},"reference":[{"key":"174_CR1","unstructured":"Tsitsiklis, J.N.: Problems in decentralized decision making and computation. Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (1984)"},{"key":"174_CR2","unstructured":"Tsitsiklis, J.N., Bertsekas, D.P., Athans, M.: Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Autom. Control 31(9), 803\u2013812 (1986)"},{"key":"174_CR3","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont (1997)"},{"issue":"1","key":"174_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.jpdc.2006.08.010","volume":"67","author":"L Xiao","year":"2007","unstructured":"Xiao, L., Boyd, S., Kim, S.J.: Distributed average consensus with least-mean-square deviation. J. Parallel Distrib. Comput. 67(1), 33\u201346 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"174_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiabl optimization. SIAM J. Optim. 12(1), 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"174_CR6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129(2), 163\u2013195 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"174_CR7","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1137\/08073038X","volume":"20","author":"B Johansson","year":"2009","unstructured":"Johansson, B., Rabi, M., Johansson, M.: A randomized incremental subgradient method for distributed optimization in networked systems. SIAM J. Optim. 20(3), 1157\u20131170 (2009)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"174_CR8","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TAC.2010.2041686","volume":"55","author":"A Nedi\u0107","year":"2010","unstructured":"Nedi\u0107, A., Ozdaglar, A., Parrilo, P.A.: Constrained consensus and optimization in multi-agent networks. IEEE Trans. Autom. Control 55(4), 922\u2013938 (2010)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"174_CR9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","volume":"54","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107, A., Ozdaglar, : Distributed subgradient methods for multi-agent optimization. IEEE Trans. Autom. Control 54(1), 48\u201361 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"174_CR10","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TAC.2011.2161027","volume":"57","author":"J Duchi","year":"2012","unstructured":"Duchi, J., Agarwal, A., Wainwright, M.: Dual averaging for distributed optimization: convergence analysis and network scaling. IEEE Trans. Autom. Control 57(3), 592\u2013606 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"key":"174_CR11","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. A 120(1), 261\u2013283 (2009)"},{"key":"174_CR12","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11, 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"174_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s10898-008-9370-2","volume":"47","author":"A Nedi\u0107","year":"2010","unstructured":"Nedi\u0107, A., Ozdaglar, A.: Convergence rate for consensus with delays. J. Glob. Optim. 47(3), 437\u2013456 (2010)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"174_CR14","doi-asserted-by":"crossref","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508\u20132530 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"174_CR15","first-page":"516","volume":"147","author":"SS Ram","year":"2011","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Distributed stochastic subgradient projection algorithms for convex optimization. J. Optim. Theory Appl. 147(3), 516\u2013545 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"174_CR16","doi-asserted-by":"crossref","unstructured":"Spall, J.C.: Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control. Wiley, Hoboken, NJ (2003)","DOI":"10.1002\/0471722138"},{"issue":"2","key":"174_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10898-005-3834-4","volume":"35","author":"AM Bagirov","year":"2006","unstructured":"Bagirov, A.M., Ugon, J.: Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization. J. Glob. Optim. 35(2), 163\u2013195 (2006)","journal-title":"J. Glob. Optim."},{"key":"174_CR18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10898-012-9866-7","volume":"56","author":"P Belitz","year":"2013","unstructured":"Belitz, P., Bewley, T.: New horizons in sphere-packing theory, part II: lattice-based derivative-free optimization via global surrogates. J. Glob. Optim. 56, 61\u201391 (2013). doi: 10.1007\/s10898-012-9866-7","journal-title":"J. Glob. Optim."},{"key":"174_CR19","unstructured":"Nesterov, Y.: Random gradient-free minimization of convex functions, Technical report, Center for Operations Research and Econometrics (CORE). Catholic University of Louvain (2011)"},{"issue":"2","key":"174_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1023\/A:1008387208683","volume":"16","author":"CS Shao","year":"2000","unstructured":"Shao, C.S., Richard, B., Elizabeth, E., Robert, B.S.: Global optimization for molecular clusters using a new smoothing approach. J. Glob. Optim. 16(2), 167\u2013196 (2000)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"174_CR21","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1137\/110831659","volume":"22","author":"JC Duchi","year":"2012","unstructured":"Duchi, J.C., Bartlett, P.L., Wainwrighr, M.J.: Randomized smoothing for stochastic optimization. SIAM J. Optim. 22(2), 674\u2013701 (2012)","journal-title":"SIAM J. Optim."},{"key":"174_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"RA Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"174_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0005-1098(80)90086-2","volume":"16","author":"BT Polyak","year":"1980","unstructured":"Polyak, B.T., Tsypkin, J.: Robust identification. Automatica 16, 53\u201363 (1980)","journal-title":"Automatica"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0174-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0174-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:06Z","timestamp":1559264346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0174-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,25]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0174-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,25]]}}}