{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:51:29Z","timestamp":1743007889791,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031319747"},{"type":"electronic","value":"9783031319754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-31975-4_32","type":"book-chapter","created":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T21:56:29Z","timestamp":1683755789000},"page":"418-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Remarkable Efficiency of\u00a0SMART"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1084-5672","authenticated-orcid":false,"given":"Max","family":"Kahl","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7189-2275","authenticated-orcid":false,"given":"Stefania","family":"Petra","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8999-2338","authenticated-orcid":false,"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4638-9245","authenticated-orcid":false,"given":"Gabriele","family":"Steidl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2936-4556","authenticated-orcid":false,"given":"Matthias","family":"Zisler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,10]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"1","key":"32_CR2","first-page":"183","volume":"58","author":"SI Amari","year":"2010","unstructured":"Amari, S.I., Cichocki, A.: Information geometry of divergence functions. Bull. Polish Acad. Sci 58(1), 183\u2013195 (2010)","journal-title":"Bull. Polish Acad. Sci"},{"key":"32_CR3","unstructured":"Amari, S.I., Nagaoka, H.: Methods of Information Geometry. American Mathematical Society and Oxford University Press (2000)"},{"key":"32_CR4","first-page":"27","volume":"4","author":"HG Bauschke","year":"1997","unstructured":"Bauschke, H.G., Borwein, J.M.: Legendre functions and the method of random bregman projections. J. Convex Anal. 4, 27\u201367 (1997)","journal-title":"J. Convex Anal."},{"issue":"3","key":"32_CR5","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."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Brown, L.D.: Fundamentals of Statistical Exponential Families. Institute of Mathematical Statistics, Hayward (1986)","DOI":"10.1214\/lnms\/1215466757"},{"issue":"1","key":"32_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/83.210869","volume":"2","author":"CL Byrne","year":"1993","unstructured":"Byrne, C.L.: Iterative image reconstruction algorithms based on cross-entropy minimization. IEEE Trans. Image Process. 2(1), 96\u2013103 (1993)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1137\/22M1481865","volume":"4","author":"A Chambolle","year":"2022","unstructured":"Chambolle, A., Contreras, J.: Accelerated Bregman primal-dual methods applied to optimal transport and Wasserstein barycenter problems. SIAM J. Math. Data Sci. 4(4), 1369\u20131395 (2022)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1), 253\u2013287 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"32_CR10","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":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1214\/aos\/1176348385","volume":"19","author":"I Csisz\u00e1r","year":"1991","unstructured":"Csisz\u00e1r, I.: Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. Ann. Stat. 19(4), 2032\u20132066 (1991)","journal-title":"Ann. Stat."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10107-021-01618-1","volume":"194","author":"RA Dragomir","year":"2022","unstructured":"Dragomir, R.A., Taylor, A.B., d\u2019Aspremont, A., Bolte, J.: Optimal complexity and certification of Bregman first-order methods. Math. Program. 194, 41\u201383 (2022)","journal-title":"Math. Program."},{"issue":"2","key":"32_CR13","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TIT.2017.2782789","volume":"64","author":"M El Gheche","year":"2017","unstructured":"El Gheche, M., Chierchia, G., Pesquet, J.C.: Proximity operators of discrete information divergences. IEEE Trans. Inf. Theory 64(2), 1092\u20131104 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-022-01779-7","volume":"198","author":"DH Gutman","year":"2023","unstructured":"Gutman, D.H., Pe\u00f1a, J.F.: Perturbed Fenchel duality and first-order methods. Math. Program. 198(1), 443\u2013469 (2023)","journal-title":"Math. Program."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10589-021-00273-8","volume":"79","author":"F Hanzely","year":"2021","unstructured":"Hanzely, F., Richt\u00e1rik, P., Xiao, L.: Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. Comput. Optim. Appl. 79, 405\u2013440 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"32_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28891-0","volume-title":"Riemannian Geometry and Geometric Analysis","author":"J Jost","year":"2005","unstructured":"Jost, J.: Riemannian Geometry and Geometric Analysis, 4th edn. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-28891-0","edition":"4"},{"issue":"1\u20133","key":"32_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF01594943","volume":"50","author":"A Lent","year":"1991","unstructured":"Lent, A., Censor, Y.: The primal-dual algorithm as a constraint-set-manipulation device. Math. Program. 50(1\u20133), 343\u2013357 (1991)","journal-title":"Math. Program."},{"key":"32_CR18","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, Hoboken (1983)"},{"issue":"4","key":"32_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s102080010032","volume":"2","author":"YE Nesterov","year":"2002","unstructured":"Nesterov, Y.E., Todd, M.J.: On the Riemannian geometry defined by self-concordant barriers and interior-point methods. Found. Comput. Math. 2(4), 333\u2013361 (2002)","journal-title":"Found. Comput. Math."},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-38267-3_10","volume-title":"Scale Space and Variational Methods in Computer Vision","author":"S Petra","year":"2013","unstructured":"Petra, S., Schn\u00f6rr, C., Becker, F., Lenzen, F.: B-SMART: Bregman-based first-order algorithms for non-negative compressed sensing problems. In: Kuijper, A., Bredies, K., Pock, T., Bischof, H. (eds.) SSVM 2013. LNCS, vol. 7893, pp. 110\u2013124. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38267-3_10"},{"issue":"1","key":"32_CR21","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170(1), 67\u201396 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1284-2","journal-title":"Math. Program."},{"key":"32_CR22","unstructured":"Tseng, P.: On Accelerated Proximal Gradient Methods for Convex-Concave Optimization (2008, unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Scale Space and Variational Methods in Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-31975-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:21:18Z","timestamp":1710246078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-31975-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031319747","9783031319754"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-31975-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSVM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Scale Space and Variational Methods in Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Margherita di Pula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scalespace2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventi.unibo.it\/ssvm2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"57","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":"79% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}