{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T06:14:24Z","timestamp":1774505664762,"version":"3.50.1"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T00:00:00Z","timestamp":1774483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012190","name":"ministry of science and higher education","doi-asserted-by":"crossref","award":["075-03-2024-214"],"award-info":[{"award-number":["075-03-2024-214"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10957-026-02961-z","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T04:09:13Z","timestamp":1774498153000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation"],"prefix":"10.1007","volume":"209","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3217-3614","authenticated-orcid":false,"given":"Aleksandr","family":"Beznosikov","sequence":"first","affiliation":[]},{"given":"Georgiy","family":"Kormakov","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Grigorievskiy","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Rudakov","sequence":"additional","affiliation":[]},{"given":"Ruslan","family":"Nazykov","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Rogozin","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Vakhrushev","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Savchenko","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Tak\u00e1\u010d","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Gasnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,26]]},"reference":[{"key":"2961_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp. 308\u2013318 (2016)","DOI":"10.1145\/2976749.2978318"},{"issue":"4","key":"2961_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. (Csur) 51(4), 1\u201335 (2018)","journal-title":"ACM Comput. Surv. (Csur)"},{"key":"2961_CR3","unstructured":"Alacaoglu, A., Malitsky, Y.: Stochastic variance reduction for variational inequality methods. arXiv:2102.08352 (2021)"},{"key":"2961_CR4","unstructured":"Alistarh, D., Grubic, D., Li, J., Tomioka, R., Vojnovic, M.: QSGD: communication-efficient SGD via gradient quantization and encoding. In: Advances in Neural Information Processing Systems, pp. 1709\u20131720 (2017)"},{"key":"2961_CR5","unstructured":"Alistarh, D., Hoefler, T., Johansson, M., Khirirat, S., Konstantinov, N., Renggli, C.: The convergence of sparsified gradient methods. In: Advances in Neural Information Processing Systems (2018)"},{"key":"2961_CR6","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-order methods in optimization. SIAM (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"2961_CR7","unstructured":"Beznosikov, A., Horv\u00e1th, S., Richt\u00e1rik, P., Safaryan, M.: On biased compression for distributed learning. arXiv:2002.12410 (2020)"},{"key":"2961_CR8","doi-asserted-by":"publisher","unstructured":"Bioucas-Dias, J.M., Figueiredo, M.A.T.: Alternating direction algorithms for constrained sparse regression: Application to hyperspectral unmixing. In: 2010 2nd Workshop on Hyperspectral Image and Signal Processing: Evolution in Remote Sensing, pp. 1\u20134 (2010). https:\/\/doi.org\/10.1109\/WHISPERS.2010.5594963","DOI":"10.1109\/WHISPERS.2010.5594963"},{"key":"2961_CR9","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends\u00ae Mach. Learn. 3(1), 1\u2013122 (2011)"},{"issue":"4","key":"2961_CR10","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1073\/pnas.56.4.1080","volume":"56","author":"FE Browder","year":"1966","unstructured":"Browder, F.E.: Existence and approximation of solutions of nonlinear variational inequalities. Proc. Natl. Acad. Sci. 56(4), 1080\u20131086 (1966)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2961_CR11","doi-asserted-by":"crossref","unstructured":"Cai, D., Fan, T., Kang, Y., Fan, L., Xu, M., Wang, S., Yang, Q.: Accelerating vertical federated learning. IEEE Transactions on Big Data p. 1\u201310 (2022)","DOI":"10.1109\/TBDATA.2022.3192898"},{"key":"2961_CR12","unstructured":"Castiglia, T., Das, A., Wang, S., Patterson, S.: Compressed-vfl: communication-efficient learning with vertically partitioned data (2023)"},{"issue":"3","key":"2961_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"2961_CR14","doi-asserted-by":"crossref","unstructured":"Chen, C., Zhou, J., Wang, L., Wu, X., Fang, W., Tan, J., Wang, L., Liu, A.X., Wang, H., Hong, C.: When homomorphic encryption marries secret sharing: Secure large-scale sparse logistic regression and applications in risk control. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery Data Mining, KDD \u201921, p. 2652\u20132662. Association for Computing Machinery, New York, NY, USA (2021)","DOI":"10.1145\/3447548.3467210"},{"key":"2961_CR15","unstructured":"Chen, W., Horvath, S., Richtarik, P.: Optimal client sampling for federated learning. arXiv:2010.13723 (2020)"},{"key":"2961_CR16","unstructured":"Chen, W., Ma, G., Fan, T., Kang, Y., Xu, Q., Yang, Q.: Secureboost+: a high performance gradient boosting tree framework for large scale vertical federated learning (2021)"},{"key":"2961_CR17","unstructured":"Cho, Y.J., Wang, J., Joshi, G.: Client selection in federated learning: convergence analysis and power-of-choice selection strategies. arXiv:2010.01243 (2020)"},{"key":"2961_CR18","doi-asserted-by":"crossref","unstructured":"Dankar, F.K., Madathil, N., Dankar, S.K., Boughorbel, S.: Privacy-preserving analysis of distributed biomedical data: Designing efficient and secure multiparty computations using distributed statistical learning theory. JMIR Med Inform 7(2), e12,702 (2019)","DOI":"10.2196\/12702"},{"key":"2961_CR19","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in neural information processing systems, pp. 1646\u20131654 (2014)"},{"issue":"55","key":"2961_CR20","first-page":"1663","volume":"11","author":"PA Forero","year":"2010","unstructured":"Forero, P.A., Cano, A., Giannakis, G.B.: Consensus-based distributed support vector machines. J. Mach. Learn. Res. 11(55), 1663\u20131707 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2961_CR21","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":"2961_CR22","doi-asserted-by":"crossref","unstructured":"Ge, N., Li, G., Zhang, L., Liu, Y.L.Y.: Failure prediction in production line based on federated learning: an empirical study (2021)","DOI":"10.1007\/s10845-021-01775-2"},{"key":"2961_CR23","doi-asserted-by":"publisher","unstructured":"Ghosh, A., Maity, R.K., Mazumdar, A., Ramchandran, K.: Communication efficient distributed approximate Newton method. In: IEEE International Symposium on Information Theory (ISIT) (2020). https:\/\/doi.org\/10.1109\/ISIT44484.2020.9174216","DOI":"10.1109\/ISIT44484.2020.9174216"},{"key":"2961_CR24","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 (1975)","DOI":"10.1051\/m2an\/197509R200411"},{"key":"2961_CR25","unstructured":"Goodfellow, I.: Nips 2016 tutorial: generative adversarial networks. arXiv:1701.00160 (2016)"},{"key":"2961_CR26","unstructured":"Gorbunov, E., Burlachenko, K., Li, Z., Richt\u00e1rik, P.: MARINA: faster non-convex distributed learning with compression. In: 38th International Conference on Machine Learning (2021)"},{"key":"2961_CR27","unstructured":"Horvath, S., Ho, C.Y., Horvath, L., Sahu, A.N., Canini, M., Richt\u00e1rik, P.: Natural compression for distributed deep learning. arXiv:1905.10988 (2019)"},{"key":"2961_CR28","unstructured":"Hu, Y., Liu, P., Kong, L., Niu, D.: Learning privately over distributed features: an admm sharing approach. arXiv:1907.07735 (2019)"},{"key":"2961_CR29","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. Neural. Inf. Process. Syst. 26, 315\u2013323 (2013)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2961_CR30","doi-asserted-by":"crossref","unstructured":"Kairouz, P., McMahan, H.B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A.N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., et al.: Advances and open problems in federated learning. Found. Trends\u00ae Mach. Learn. 14(1\u20132), 1\u2013210 (2021)","DOI":"10.1561\/2200000083"},{"key":"2961_CR31","unstructured":"Karimireddy, S.P., Rebjock, Q., Stich, S., Jaggi, M.: Error feedback fixes signsgd and other gradient compression schemes. In: International Conference on Machine Learning, pp. 3252\u20133261. PMLR (2019)"},{"key":"2961_CR32","unstructured":"Khan, A., ten Thij, M., Wilbik, A.: Vertical federated learning: a structured literature review (2023)"},{"key":"2961_CR33","unstructured":"Kone\u010dn\u1ef3, J., McMahan, H.B., Yu, F.X., Richt\u00e1rik, P., Suresh, A.T., Bacon, D.: Federated learning: strategies for improving communication efficiency. arXiv:1610.05492 (2016)"},{"key":"2961_CR34","unstructured":"Kone\u010dn\u00fd, J., McMahan, H.B., Yu, F., Richt\u00e1rik, P., Suresh, A.T., Bacon, D.: Federated learning: strategies for improving communication efficiency. In: NIPS Private Multi-Party Machine Learning Workshop (2016)"},{"key":"2961_CR35","first-page":"35","volume":"12","author":"GM Korpelevich","year":"1977","unstructured":"Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Matecon 12, 35\u201349 (1977)","journal-title":"Matecon"},{"key":"2961_CR36","unstructured":"Lai, F., Zhu, X., Madhyastha, H.V., Chowdhury, M.: Oort: efficient federated learning via guided participant selection. In: 15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 21), pp. 19\u201335. USENIX Association (2021)"},{"key":"2961_CR37","unstructured":"Li, M., Andersen, D.G., Smola, A.J., Yu, K.: Communication efficient distributed machine learning with the parameter server. In: Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, K. Weinberger (eds.) Advances in Neural Information Processing Systems, vol. 27. Curran Associates, Inc. (2014)"},{"key":"2961_CR38","unstructured":"Liu, Y., Kang, Y., Zou, T., Pu, Y., He, Y., Ye, X., Ouyang, Y., Zhang, Y.Q., Yang, Q.: Vertical federated learning. arXiv:2211.12814 (2022)"},{"key":"2961_CR39","doi-asserted-by":"crossref","unstructured":"Liu, Y., Kang, Y., Zou, T., Pu, Y., He, Y., Ye, X., Ouyang, Y., Zhang, Y.Q., Yang, Q.: Vertical federated learning: concepts, advances, and challenges. IEEE Trans. Knowl. Data Eng. (2024)","DOI":"10.1109\/TKDE.2024.3352628"},{"key":"2961_CR40","unstructured":"Lu, H., Yang, J.: On a unified and simplified proof for the ergodic convergence rates of ppm, pdhg and admm. arXiv:2305.02165 (2023)"},{"key":"2961_CR41","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics, pp. 1273\u20131282. PMLR (2017)"},{"key":"2961_CR42","unstructured":"Mishchenko, K., Gorbunov, E., Tak\u00e1\u010d, M., Richt\u00e1rik, P.: Distributed learning with compressed gradient differences. arXiv:1901.09269 (2019)"},{"issue":"1","key":"2961_CR43","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence o (1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"2961_CR44","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer Science & Business Media, Berlin (2003)"},{"issue":"2","key":"2961_CR45","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2), 319\u2013344 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"2961_CR46","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2961_CR47","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/16M1060182","volume":"27","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Stich, S.U.: Efficiency of the accelerated coordinate descent method on structured optimization problems. SIAM J. Optim. 27(1), 110\u2013123 (2017)","journal-title":"SIAM J. Optim."},{"key":"2961_CR48","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: Sarah: a novel method for machine learning problems using stochastic recursive gradient. In: International Conference on Machine Learning, pp. 2613\u20132621. PMLR (2017)"},{"key":"2961_CR49","doi-asserted-by":"crossref","unstructured":"Parikh, N., Boyd, S., et al.: Proximal algorithms. Found. Trends\u00ae Optim. 1(3), 127\u2013239 (2014)","DOI":"10.1561\/2400000003"},{"key":"2961_CR50","doi-asserted-by":"crossref","unstructured":"Polyak, B.: Introduction to Optimization (2020)","DOI":"10.1007\/978-3-030-68713-7"},{"key":"2961_CR51","unstructured":"Qian, X., Richt\u00e1rik, P., Zhang, T.: Error compensated distributed sgd can be accelerated. arXiv:2010.00091 (2020)"},{"issue":"5","key":"2961_CR52","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1080\/10556788.2016.1190360","volume":"31","author":"Z Qu","year":"2016","unstructured":"Qu, Z., Richt\u00e1rik, P.: Coordinate descent with arbitrary sampling i: algorithms and complexity. Optim. Method. Softw. 31(5), 829\u2013857 (2016)","journal-title":"Optim. Method. Softw."},{"key":"2961_CR53","doi-asserted-by":"crossref","unstructured":"Ribero, M., Vikalo, H.: Communication-efficient federated learning via optimal client sampling. arXiv:2007.15197 (2020)","DOI":"10.52591\/lxai2020071310"},{"key":"2961_CR54","unstructured":"Richt\u00e1rik, P., Sokolov, I., Fatkhullin, I.: EF21: a new, simpler, theoretically better, and practically faster error feedback. arXiv:2106.05203 (2021)"},{"key":"2961_CR55","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: On optimal probabilities in stochastic coordinate descent methods. arXiv:1310.3438 (2013)"},{"key":"2961_CR56","unstructured":"Rockafellar, R.: Convex functions, monotone operators and variational inequalities. theory and applications of monotone operators. Theory and applications of monotone operators pp. 13\u201365 (1969)"},{"key":"2961_CR57","unstructured":"Salim, A., Condat, L., Kovalev, D., Richt\u00e1rik, P.: An optimal algorithm for strongly convex minimization under affine constraints. In: International conference on artificial intelligence and statistics, pp. 4482\u20134498. PMLR (2022)"},{"issue":"1\u20132","key":"2961_CR58","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"2961_CR59","unstructured":"Sedghi, H., Anandkumar, A., Jonckheere, E.: Multi-step stochastic admm in high dimensions: Applications to sparse optimization and matrix decomposition. In: Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, K. Weinberger (eds.) Advances in Neural Information Processing Systems, vol. 27. Curran Associates, Inc. (2014)"},{"key":"2961_CR60","doi-asserted-by":"crossref","unstructured":"Seide, F., Fu, H., Droppo, J., Li, G., Yu, D.: 1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns. In: Fifteenth Annual Conference of the International Speech Communication Association (2014)","DOI":"10.21437\/Interspeech.2014-274"},{"key":"2961_CR61","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"issue":"1","key":"2961_CR62","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02575559","volume":"7","author":"M Sibony","year":"1970","unstructured":"Sibony, M.: M\u00e9thodes it\u00e9ratives pour les \u00e9quations et in\u00e9quations aux d\u00e9riv\u00e9es partielles non lin\u00e9aires de type monotone. Calcolo 7(1), 65\u2013183 (1970)","journal-title":"Calcolo"},{"key":"2961_CR63","first-page":"1","volume":"18","author":"V Smith","year":"2018","unstructured":"Smith, V., Forte, S., Ma, C., Tak\u00e1\u010d, M., Jordan, M.I., Jaggi, M.: CoCoA: a general framework for communication-efficient distributed optimization. J. Mach. Learn. Res. 18, 1\u201349 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"2961_CR64","doi-asserted-by":"crossref","unstructured":"Stanko, S., Karimullin, T., Beznosikov, A., Gasnikov, A.: Accelerated methods with compression for horizontal and vertical federated learning. arXiv:2404.13328 (2024)","DOI":"10.1007\/s10957-025-02893-0"},{"key":"2961_CR65","unstructured":"Stich, S.U., Cordonnier, J.B., Jaggi, M.: Sparsified sgd with memory. arXiv:1809.07599 (2018)"},{"key":"2961_CR66","unstructured":"Stich, S.U., Karimireddy, S.P.: The error-feedback framework: Better rates for sgd with delayed gradients and compressed communication. arXiv:1909.05350 (2019)"},{"key":"2961_CR67","doi-asserted-by":"crossref","unstructured":"Sun, J., Xu, Z., Yang, D., Nath, V., Li, W., Zhao, C., Xu, D., Chen, Y., Roth, H.R.: Communication-efficient vertical federated learning with limited overlapping samples (2023)","DOI":"10.1109\/ICCV51070.2023.00480"},{"issue":"2","key":"2961_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3377454","volume":"53","author":"J Verbraeken","year":"2020","unstructured":"Verbraeken, J., Wolting, M., Katzy, J., Kloppenburg, J., Verbelen, T., Rellermeyer, J.S.: A survey on distributed machine learning. ACM Comput. Surv. (csur) 53(2), 1\u201333 (2020)","journal-title":"ACM Comput. Surv. (csur)"},{"key":"2961_CR69","unstructured":"Vogels, T., Karinireddy, S.P., Jaggi, M.: Powersgd: practical low-rank gradient compression for distributed optimization. Adv. Neural Inf. Process. Syst. 32 (Nips 2019) 32(CONF) (2019)"},{"key":"2961_CR70","doi-asserted-by":"crossref","unstructured":"Wahlberg, B., Boyd, S., Annergren, M., Wang, Y.: An admm algorithm for a class of total variation regularized estimation problems*. IFAC Proceedings Volumes 45(16), 83\u201388 (2012). 16th IFAC Symposium on System Identification","DOI":"10.3182\/20120711-3-BE-2027.00310"},{"key":"2961_CR71","unstructured":"Wang, H., Banerjee, A.: Online alternating direction method (longer version). arXiv:1306.3721 (2013)"},{"key":"2961_CR72","unstructured":"Wei, K., Li, J., Ma, C., Ding, M., Wei, S., Wu, F., Chen, G., Ranbaduge, T.: Vertical federated learning: challenges, methodologies and experiments (2022)"},{"key":"2961_CR73","unstructured":"Xie, C., Chen, P.Y., Zhang, C., Li, B.: Improving privacy-preserving vertical federated learning by efficient communication with admm. arXiv:2207.10226 (2022)"},{"key":"2961_CR74","unstructured":"Xie, C., Chen, P.Y., Zhang, C., Li, B.: Improving vertical federated learning by efficient communication with ADMM. In: Workshop on Federated Learning: Recent Advances and New Challenges (in Conjunction with NeurIPS 2022) (2022)"},{"key":"2961_CR75","unstructured":"Xu, W., Fan, H., Li, K., Yang, K.: Efficient batch homomorphic encryption for vertically federated xgboost (2021)"},{"issue":"3","key":"2961_CR76","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1137\/16M1082305","volume":"27","author":"Y Xu","year":"2017","unstructured":"Xu, Y.: Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming. SIAM J. Optim. 27(3), 1459\u20131484 (2017)","journal-title":"SIAM J. Optim."},{"key":"2961_CR77","unstructured":"Yang, L., Chai, D., Zhang, J., Jin, Y., Wang, L., Liu, H., Tian, H., Xu, Q., Chen, K.: A survey on vertical federated learning: From a layered perspective. arXiv:2304.01829 (2023)"},{"key":"2961_CR78","doi-asserted-by":"crossref","unstructured":"Zhang, J., Hong, M., Zhang, S.: On lower iteration complexity bounds for the convex concave saddle point problems. Mathematical Programming pp. 1\u201335 (2021)","DOI":"10.1007\/s10107-021-01660-z"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02961-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-02961-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02961-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T04:09:37Z","timestamp":1774498177000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-02961-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,26]]},"references-count":78,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2961"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-02961-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,26]]},"assertion":[{"value":"31 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"18"}}