{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:20:28Z","timestamp":1743135628092,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_18","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"218-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Analysis of\u00a0a\u00a0Stochastic Variant of\u00a0Generalized Alternating Direction Method of\u00a0Multipliers"],"prefix":"10.1007","author":[{"given":"Jia","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congying","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de Dirichlet non lin\u00e9aires. Revue fran\u00e7aise d\u2019automatique, informatique, recherche op\u00e9rationnelle. Analyse num\u00e9rique 9(R2), 41\u201376 (1975)","DOI":"10.1051\/m2an\/197509R200411"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"18_CR3","series-title":"Computational Methods in Applied Sciences","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-94-017-9054-3_4","volume-title":"Modeling, Simulation and Optimization for Science and Technology","author":"R Glowinski","year":"2014","unstructured":"Glowinski, R.: On alternating direction methods of multipliers: a historical perspective. In: Fitzgibbon, W., Kuznetsov, Y.A., Neittaanm\u00e4ki, P., Pironneau, O. (eds.) Modeling, Simulation and Optimization for Science and Technology. CMAS, vol. 34, pp. 59\u201382. Springer, Dordrecht (2014). https:\/\/doi.org\/10.1007\/978-94-017-9054-3_4"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1), 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$O(1\/n)$$ convergence rate of the Douglas-Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","volume":"130","author":"B He","year":"2015","unstructured":"He, B., Yuan, X.: On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers. Numer. Math. 130(3), 567\u2013577 (2015)","journal-title":"Numer. Math."},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","volume":"66","author":"W Deng","year":"2016","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. J. Sci. Comput. 66(3), 889\u2013916 (2016)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/140974237","volume":"54","author":"WH Yang","year":"2016","unstructured":"Yang, W.H., Han, D.: Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems. SIAM J. Numer. Anal. 54(2), 625\u2013640 (2016)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1287\/moor.2017.0875","volume":"43","author":"D Han","year":"2018","unstructured":"Han, D., Sun, D., Zhang, L.: Linear rate convergence of the alternating direction method of multipliers for convex composite programming. Math. Oper. Res. 43(2), 622\u2013637 (2018)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., et al.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"2272","DOI":"10.1137\/19M1242276","volume":"30","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Luo, Z.Q.: A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization. SIAM J. Optim. 30(3), 2272\u20132302 (2020)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., et al.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1), 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"18_CR21","unstructured":"Ouyang, H., He, N., Tran, L., et al.: Stochastic alternating direction method of multipliers. In: Proceedings of the 30th International Conference on Machine Learning, pp. 80\u201388. PMLR, Atlanta (2013)"},{"key":"18_CR22","unstructured":"Suzuki, T.: Dual averaging and proximal gradient descent for online alternating direction multiplier method. In: Proceedings of the 30th International Conference on Machine Learning, pp. 392\u2013400. PMLR, Atlanta (2013)"},{"key":"18_CR23","unstructured":"Suzuki, T.: Stochastic dual coordinate ascent with alternating direction method of multipliers. In: Proceedings of the 31th International Conference on Machine Learning, pp. 736\u2013744. PMLR, Beijing (2014)"},{"key":"18_CR24","unstructured":"Zhao, P., Yang, J., Zhang, T., et al.: Adaptive stochastic alternating direction method of multipliers. In: Proceedings of the 32th International Conference on Machine Learning, pp. 69\u201377. PMLR, Lille (2014)"},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10915-017-0621-6","volume":"76","author":"X Gao","year":"2018","unstructured":"Gao, X., Jiang, B., Zhang, S.: On the information-adaptive variants of the ADMM: an iteration complexity perspective. J. Sci. Comput. 76(1), 327\u2013363 (2018)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s12532-015-0078-2","volume":"7","author":"EX Fang","year":"2015","unstructured":"Fang, E.X., He, B., Liu, H., Yuan, X.: Generalized alternating direction method of multipliers: new theoretical insights and applications. Math. Program. Comput. 7(2), 149\u2013187 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0078-2","journal-title":"Math. Program. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:24:23Z","timestamp":1672550663000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}