{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:42:01Z","timestamp":1771623721909,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"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":["Math. Program."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10107-022-01779-7","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T12:03:56Z","timestamp":1643889836000},"page":"443-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Perturbed Fenchel duality and first-order methods"],"prefix":"10.1007","volume":"198","author":[{"given":"David H.","family":"Gutman","sequence":"first","affiliation":[]},{"given":"Javier F.","family":"Pe\u00f1a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"key":"1779_CR1","unstructured":"Abernethy, J., Lai,K., Levy,K. , Wang,J.: Faster rates for convex-concave games. arXiv preprint arXiv:1805.06792, 2018"},{"key":"1779_CR2","unstructured":"Abernethy, J.,Wang,J.: On Frank-Wolfe and equilibrium computation. In Advances in Neural Information Processing Systems, pages 6584\u20136593, 2017"},{"issue":"1","key":"1779_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/130941961","volume":"25","author":"F Bach","year":"2015","unstructured":"Bach, F.: Duality between subgradient and conditional gradient methods. SIAM J. Optim. 25(1), 115\u2013129 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1779_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"H Bauschke","year":"2016","unstructured":"Bauschke, H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2016)","journal-title":"Math. Oper. Res."},{"key":"1779_CR5","doi-asserted-by":"crossref","unstructured":"Bauschke, H., Combettes,P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, volume 408. Springer, 2011","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"1779_CR6","doi-asserted-by":"crossref","unstructured":"Beck,A.: First-Order Methods in Optimization, volume 25. SIAM, 2017","DOI":"10.1137\/1.9781611974997"},{"issue":"3","key":"1779_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1779_CR8","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."},{"issue":"2","key":"1779_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11228-016-0376-5","volume":"25","author":"J Bello-Cruz","year":"2017","unstructured":"Bello-Cruz, J.: On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions. Set-Valued and Variational Analysis 25(2), 245\u2013263 (2017)","journal-title":"Set-Valued and Variational Analysis"},{"key":"1779_CR10","doi-asserted-by":"crossref","unstructured":"Borwein,J., Lewis,A.: Convex Analysis and Nonlinear Optimization. Springer, New York, 2000","DOI":"10.1007\/978-1-4757-9859-3"},{"key":"1779_CR11","unstructured":"Bubeck,S., Lee,Y. , Singh,M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent. arXiv preprint arXiv:1506.08187, 2015"},{"issue":"3","key":"1779_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1779_CR13","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1137\/18M1172314","volume":"29","author":"J Diakonikolas","year":"2019","unstructured":"Diakonikolas, J., Orecchia, L.: The approximate duality gap technique: a unified theory of first-order methods. SIAM J. Optim. 29(1), 660\u2013689 (2019)","journal-title":"SIAM J. Optim."},{"key":"1779_CR14","doi-asserted-by":"crossref","unstructured":"Dragomir,R., Taylor,A., d\u2019Aspremont,A., Bolte,J.: Optimal complexity and certification of Bregman first-order methods. Mathematical Programming, pages 1\u201343, 2021","DOI":"10.1007\/s10107-021-01618-1"},{"issue":"1","key":"1779_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/16M1072528","volume":"28","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Fazel, M., Roy, S.: An optimal first order method based on optimal quadratic averaging. SIAM J. Optim. 28(1), 251\u2013271 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1779_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10107-014-0841-6","volume":"155","author":"R Freund","year":"2016","unstructured":"Freund, R., Grigas, P.: New analysis and results for the Frank-Wolfe method. Math. Program. 155(1\u20132), 199\u2013230 (2016)","journal-title":"Math. Program."},{"key":"1779_CR17","unstructured":"Gutman, D., Pe\u00f1a, J.: A unified framework for Bregman proximal methods: subgradient, gradient, and accelerated gradient schemes. arXiv preprint arXiv:1812.10198, 2018"},{"key":"1779_CR18","doi-asserted-by":"crossref","unstructured":"Gutman, D., Pe\u00f1a, J.: Convergence rates of proximal gradient methods via the convex conjugate. SIAM J. Opt., 29(1):162\u2013174, 2019","DOI":"10.1137\/18M1164329"},{"issue":"2","key":"1779_CR19","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-021-00273-8","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richtarik, P., Xiao, L.: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. Comput. Optim. Appl. 79(2), 405\u2013440 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1779_CR20","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty,J., Lemar\u00e9chal,C.: Convex Analysis and Minimization Algorithms. Springer-Verlag, Berlin, 1993","DOI":"10.1007\/978-3-662-02796-7"},{"key":"1779_CR21","unstructured":"Jaggi,M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In ICML, volume 28 of JMLR Proceedings, pages 427\u2013435, 2013"},{"issue":"1","key":"1779_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Optim."},{"key":"1779_CR23","doi-asserted-by":"crossref","unstructured":"Lu,H.:\u201cRelative continuity\u201dfor non-Lipschitz nonsmooth convex optimization using stochastic (or deterministic) mirror descent. INFORMS J. Opt., 1(4):288\u2013303, 2019","DOI":"10.1287\/ijoo.2018.0008"},{"issue":"1","key":"1779_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"1779_CR25","unstructured":"Nemirovsky,A., Yudin,D.: Problem Complexity and Method Efficiency in Optimization. Wiley, 1983"},{"key":"1779_CR26","unstructured":"Nesterov,Y.: A method for solving the convex programming problem with convergence rate $$\\cal{O}(1\/k^2)$$. Doklady AN SSSR (in Russian). (English translation. Soviet Math. Dokl.), 269:543\u2013547, 1983"},{"issue":"1","key":"1779_CR27","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":"1779_CR28","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."},{"issue":"1\u20132","key":"1779_CR29","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1\u20132), 381\u2013404 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1779_CR30","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10107-017-1188-6","volume":"171","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Complexity bounds for primal-dual methods minimizing the model of objective function. Math. Program. 171(1), 311\u2013330 (2018)","journal-title":"Math. Program."},{"key":"1779_CR31","doi-asserted-by":"crossref","unstructured":"Pe\u00f1a. J.: Convergence of first-order methods via the convex conjugate. Oper. Res. Lett. 45, 561\u2013564 (2017)","DOI":"10.1016\/j.orl.2017.08.013"},{"key":"1779_CR32","unstructured":"Rockafellar, T.: Convex Analysis. Princeton University Press, Princeton, 1970"},{"key":"1779_CR33","unstructured":"Su,W., Boyd,S., Cand\u00e8s,E.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights. In Advances in Neural Information Processing Systems, pages 2510\u20132518, 2014"},{"key":"1779_CR34","doi-asserted-by":"crossref","unstructured":"Teboulle,M.: A simplified view of first order methods for optimization. Math. Program., p 1\u201330, 2018","DOI":"10.1007\/s10107-018-1284-2"},{"issue":"4","key":"1779_CR35","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s11075-016-0132-9","volume":"73","author":"Q Van Nguyen","year":"2016","unstructured":"Van Nguyen, Q.: Variable quasi-Bregman monotone sequences. Numeric. Alg. 73(4), 1107\u20131130 (2016)","journal-title":"Numeric. Alg."},{"issue":"3","key":"1779_CR36","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10013-016-0238-3","volume":"45","author":"Q Van Nguyen","year":"2017","unstructured":"Van Nguyen, Q.: Forward-backward splitting with Bregman distances. Vietnam J. Math. 45(3), 519\u2013539 (2017)","journal-title":"Vietnam J. Math."},{"key":"1779_CR37","unstructured":"Wang,J., Abernethy,J.: Acceleration through optimistic no-regret dynamics. In Advances in Neural Information Processing Systems, p 3824\u20133834, 2018"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01779-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01779-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01779-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T22:18:12Z","timestamp":1677017892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01779-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1779"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01779-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"4 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}