{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T13:40:01Z","timestamp":1744983601483,"version":"3.40.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:00Z","timestamp":1742947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["2112533"],"award-info":[{"award-number":["2112533"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["12951270"],"award-info":[{"award-number":["12951270"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10957-025-02646-z","type":"journal-article","created":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T01:58:12Z","timestamp":1743213492000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Penalized Stochastic Gradient Methods for Linearly Constrained Strongly Convex Optimization"],"prefix":"10.1007","volume":"205","author":[{"given":"Meng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5617-1058","authenticated-orcid":false,"given":"Paul","family":"Grigas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,26]]},"reference":[{"issue":"1","key":"2646_CR1","first-page":"8194","volume":"18","author":"Z Allen-Zhu","year":"2017","unstructured":"Allen-Zhu, Z.: Katyusha: the first direct acceleration of stochastic gradient methods. J. Mach. Learn. Res. 18(1), 8194\u20138244 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2646_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-018-1301-5","volume":"170","author":"A Atamt\u00fcrk","year":"2018","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Strong formulations for quadratic optimization with m-matrices and indicator variables. Math. Program. 170(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"2646_CR3","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Rank-one convexification for sparse regression. arXiv:1901.10334 (2019)"},{"key":"2646_CR4","unstructured":"Atamturk, A., Gomez, A.: Safe screening rules for l0-regression from perspective relaxations. In: Singh, H.D. III, A. (eds.) Proceedings of the 37th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 119, pp. 421\u2013430. PMLR (2020). https:\/\/proceedings.mlr.press\/v119\/atamturk20a.html"},{"key":"2646_CR5","first-page":"1","volume":"22","author":"A Atamt\u00fcrk","year":"2021","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A., Han, S.: Sparse and smooth signal estimation: convexification of $$\\ell _0$$ formulations. J. Mach. Learn. Res. 22, 1\u201343 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"2646_CR6","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1112\/plms\/pds099","volume":"107","author":"D Azagra","year":"2013","unstructured":"Azagra, D.: Global and fine approximation of convex functions. Proc. Lond. Math. Soc. 107(4), 799\u2013824 (2013)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"337","key":"2646_CR7","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/01621459.1972.10481216","volume":"67","author":"RE Barlow","year":"1972","unstructured":"Barlow, R.E., Brunk, H.D.: The isotonic regression problem and its dual. J. Am. Stat. Assoc. 67(337), 140\u2013147 (1972)","journal-title":"J. Am. Stat. Assoc."},{"key":"2646_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"2646_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"2646_CR10","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"2014","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, London (2014)"},{"issue":"1","key":"2646_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00048682","volume":"44","author":"D B\u00f6hning","year":"1992","unstructured":"B\u00f6hning, D.: Multinomial logistic regression algorithm. Ann. Inst. Stat. Math. 44(1), 197\u2013200 (1992)","journal-title":"Ann. Inst. Stat. Math."},{"key":"2646_CR12","doi-asserted-by":"crossref","unstructured":"Borrelli, F., Bemporad, A., Morari, M.: Predictive Control for Linear and Hybrid Systems. Cambridge University Press, Cambridge (2017)","DOI":"10.1017\/9781139061759"},{"issue":"2","key":"2646_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"2646_CR14","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E.: Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers. Now Publishers Inc (2011)","DOI":"10.1561\/9781601984616"},{"issue":"4","key":"2646_CR15","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1137\/17M1134834","volume":"28","author":"A Chambolle","year":"2018","unstructured":"Chambolle, A., Ehrhardt, M.J., Richt\u00e1rik, P., Schonlieb, C.B.: Stochastic primal\u2013dual hybrid gradient algorithm with arbitrary sampling and imaging applications. SIAM J. Optim. 28(4), 2783\u20132808 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2646_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"2646_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer 25, 161\u2013319 (2016)","journal-title":"Acta Numer"},{"key":"2646_CR18","unstructured":"CVX\u00a0Research, I.: CVX: Matlab Software for Disciplined Convex Programming, Version 2.0. http:\/\/cvxr.com\/cvx (2012)"},{"key":"2646_CR19","unstructured":"Dang, C., Lan, G.: Randomized first-order methods for saddle point optimization. arXiv:1409.8625 (2014)"},{"key":"2646_CR20","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: Saga: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol.\u00a027, pp. 1646\u20131654 (2014)"},{"issue":"6","key":"2646_CR21","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1137\/0327068","volume":"27","author":"G Di Pillo","year":"1989","unstructured":"Di Pillo, G., Grippo, L.: Exact penalty functions in constrained optimization. SIAM J. Control. Optim. 27(6), 1333\u20131360 (1989)","journal-title":"SIAM J. Control. Optim."},{"key":"2646_CR22","unstructured":"Fercoq, O., Alacaoglu, A., Necoara, I., Cevher, V.: Almost surely constrained convex optimization. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a097, pp. 1910\u20131919. PMLR (2019). https:\/\/proceedings.mlr.press\/v97\/fercoq19a.html"},{"key":"2646_CR23","unstructured":"Ghaoui, L.E., Viallon, V., Rabbani, T.: Safe feature elimination for the lasso and sparse supervised learning problems. arXiv:1009.4219 (2010)"},{"key":"2646_CR24","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer-Verlag Limited (2008). http:\/\/stanford.edu\/~boyd\/graph_dcp.html","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"2646_CR25","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi optimizer reference manual (2021). http:\/\/www.gurobi.com"},{"issue":"1","key":"2646_CR26","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-023-01924-w","volume":"202","author":"S Han","year":"2023","unstructured":"Han, S., G\u00f3mez, A., Atamt\u00fcrk, A.: $$2\\times 2$$-convexifications for convex quadratic optimization with indicator variables. Math. Program. 202(1), 95\u2013134 (2023)","journal-title":"Math. Program."},{"key":"2646_CR27","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol.\u00a026, pp. 315\u2013323 (2013)"},{"issue":"1","key":"2646_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-012-0588-x","volume":"138","author":"G Lan","year":"2013","unstructured":"Lan, G., Monteiro, R.D.: Iteration-complexity of first-order penalty methods for convex programming. Math. Program. 138(1), 115\u2013139 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"2646_CR29","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-017-1173-0","volume":"171","author":"G Lan","year":"2018","unstructured":"Lan, G., Zhou, Y.: An optimal randomized incremental gradient method. Math. Program. 171(1), 167\u2013215 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"2646_CR30","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/opre.1110.1007","volume":"60","author":"E Lim","year":"2012","unstructured":"Lim, E., Glynn, P.W.: Consistency of multidimensional convex regression. Oper. Res. 60(1), 196\u2013208 (2012)","journal-title":"Oper. Res."},{"key":"2646_CR31","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a028. Curran Associates Inc. (2015). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2015\/file\/c164bbc9d6c72a52c599bbb43d8db8e1-Paper.pdf"},{"issue":"1","key":"2646_CR32","first-page":"7854","volume":"18","author":"H Lin","year":"2018","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: Catalyst acceleration for first-order convex optimization: from theory to practice. J. Mach. Learn. Res. 18(1), 7854\u20137907 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"2646_CR33","unstructured":"Markowitz, H.M., Todd, G.P.: Mean-Variance Analysis in Portfolio Choice and Capital Markets, vol.\u00a066. Wiley (2000)"},{"key":"2646_CR34","unstructured":"Mishchenko, K., Richt\u00e1rik, P.: A stochastic penalty model for convex and nonconvex optimization with big constraints. arXiv:1810.13387 (2018)"},{"issue":"2","key":"2646_CR35","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-011-0468-9","volume":"129","author":"A Nedi\u0107","year":"2011","unstructured":"Nedi\u0107, A.: Random algorithms for convex minimization problems. Math. Program. 129(2), 225\u2013253 (2011)","journal-title":"Math. Program."},{"key":"2646_CR36","doi-asserted-by":"crossref","unstructured":"Nedich, A., Tatarenko, T.: Convergence rate of a penalty method for strongly convex problems with linear constraints. In: 2020 59th IEEE Conference on Decision and Control (CDC), pp. 372\u2013377. IEEE (2020)","DOI":"10.1109\/CDC42340.2020.9303832"},{"issue":"1","key":"2646_CR37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"2646_CR38","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"2646_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer, Berlin (2018)"},{"issue":"1","key":"2646_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01420-0","volume":"185","author":"Y Ouyang","year":"2021","unstructured":"Ouyang, Y., Xu, Y.: Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. Math. Program. 185(1), 1\u201335 (2021)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2646_CR41","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."},{"issue":"3","key":"2646_CR42","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1214\/10-AOS852","volume":"39","author":"E Seijo","year":"2011","unstructured":"Seijo, E., Sen, B.: Nonparametric least squares estimation of a multivariate convex regression function. Ann. Stat. 39(3), 1633\u20131657 (2011)","journal-title":"Ann. Stat."},{"key":"2646_CR43","unstructured":"Song, C., Wright, S.J., Diakonikolas, J.: Variance reduction via primal-dual accelerated dual averaging for nonsmooth convex finite-sums. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 139, pp. 9824\u20139834. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/song21d.html"},{"issue":"3","key":"2646_CR44","doi-asserted-by":"publisher","first-page":"2141","DOI":"10.1137\/18M1209180","volume":"31","author":"T Tatarenko","year":"2021","unstructured":"Tatarenko, T., Nedich, A.: A smooth inexact penalty reformulation of convex problems with linear constraints. SIAM J. Optim. 31(3), 2141\u20132170 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2646_CR45","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-014-0769-x","volume":"150","author":"M Wang","year":"2015","unstructured":"Wang, M., Bertsekas, D.P.: Incremental constraint projection methods for variational inequalities. Math. Program. 150(2), 321\u2013363 (2015)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02646-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02646-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02646-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T13:09:11Z","timestamp":1744981751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02646-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,26]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2646"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02646-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,3,26]]},"assertion":[{"value":"6 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"29"}}