{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T05:25:16Z","timestamp":1771910716054,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"publisher","award":["2017YFB0202003"],"award-info":[{"award-number":["2017YFB0202003"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2018JJ3616"],"award-info":[{"award-number":["2018JJ3616"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Spanish Research Projects","award":["MTM2015-64095-P"],"award-info":[{"award-number":["MTM2015-64095-P"]}]},{"name":"Spanish Research Projects","award":["PGC2018-096026-B-I00"],"award-info":[{"award-number":["PGC2018-096026-B-I00"]}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Diputaci\u00f3n General de Arag\u00f3n","award":["E24-17R"],"award-info":[{"award-number":["E24-17R"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2937005","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T20:18:45Z","timestamp":1566505125000},"page":"126515-126529","source":"Crossref","is-referenced-by-count":8,"title":["Bregman Proximal Gradient Algorithm With Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1035-3200","authenticated-orcid":false,"given":"Xiaoya","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Barrio","sequence":"additional","affiliation":[]},{"given":"M. Angeles","family":"Martinez","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lizhi","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/16M1055323"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/16M1094415"},{"key":"ref33","author":"rockafellar","year":"2015","journal-title":"Convex Analysis"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/16M1064064"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/130942954"},{"key":"ref37","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1284-2"},{"key":"ref35","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","volume":"317","author":"rockafellar","year":"2009","journal-title":"Variational Analysis"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/17M1114296"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF00934676"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940051"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483273"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0803026"},{"key":"ref16","article-title":"Stochastic model-based minimization under high-order growth","author":"davis","year":"2018","journal-title":"arXiv 1807 00255"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/32\/9\/093001"},{"key":"ref28","first-page":"1574","article-title":"Stochastic proximal gradient descent with acceleration techniques","author":"nitanda","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0034-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120869778"},{"key":"ref6","author":"bertsekas","year":"2009","journal-title":"Convex Optimization Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01068677"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/25\/12\/123006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/17M1138558"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"},{"key":"ref9","author":"borwein","year":"2010","journal-title":"Convex Analysis and Nonlinear Optimization Theory and Examples"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/110847081"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-017-9366-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012995281742"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/16M1099546"},{"key":"ref23","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Math Doklady"},{"key":"ref25","first-page":"1","article-title":"Phase retrieval, what’s new","volume":"25","author":"luke","year":"2017","journal-title":"SIAG\/OPT Views-and-News"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08809681.pdf?arnumber=8809681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:41:03Z","timestamp":1628624463000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8809681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2937005","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}