{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T11:35:18Z","timestamp":1776166518960,"version":"3.50.1"},"reference-count":42,"publisher":"Informa UK Limited","issue":"4","license":[{"start":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T00:00:00Z","timestamp":1742428800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Swedish Research Council","doi-asserted-by":"publisher","award":["2019-05319"],"award-info":[{"award-number":["2019-05319"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004063","name":"Knut and Alice Wallenberg Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2025,7,4]]},"DOI":"10.1080\/10556788.2025.2475406","type":"journal-article","created":{"date-parts":[[2025,3,20]],"date-time":"2025-03-20T07:55:30Z","timestamp":1742457330000},"page":"783-812","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["Soft quasi-Newton: guaranteed positive definiteness by relaxing the secant constraint"],"prefix":"10.1080","volume":"40","author":[{"given":"Erik","family":"Berglund","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology","place":["Sweden"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaojiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology","place":["Sweden"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Johansson","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology","place":["Sweden"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,3,20]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-015-2019-x"},{"key":"e_1_3_2_4_1","unstructured":"F. Bach and V. Perchet Highly-smooth zero-th order online optimization in Conference on Learning Theory PMLR New York USA 2016 pp. 257\u2013283."},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1177718"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4"},{"key":"e_1_3_2_7_1","first-page":"1737","article-title":"SGD-QN: careful quasi-Newton stochastic gradient descent","volume":"10","author":"Bordes A.","year":"2009","unstructured":"A. Bordes, L. Bottou, and P. Gallinari, SGD-QN: careful quasi-Newton stochastic gradient descent, J. Mach. Learn. Res. 10 (2009), pp. 1737\u20131754.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-022-01800-4"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1.3-4.197"},{"key":"e_1_3_2_14_1","unstructured":"Y.N. Dauphin R. Pascanu C. Gulcehre K. Cho S. Ganguli and Y. Bengio Identifying and attacking the saddle point problem in high-dimensional non-convex optimization in Advances in Neural Information Processing Systems Vol. 27 Montreal Quebec Canada 2014."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801002"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-014-9687-3"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00564-w"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00448-x"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaa8415"},{"key":"e_1_3_2_21_1","unstructured":"A. Lahoti S. Senapati K. Rajawat and A. Koppel Sharpened lazy incremental quasi-Newton method preprint (2023). Available at arXiv:2305.17283."},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/356068.356075"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(97)00067-0"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1122943"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357775"},{"key":"e_1_3_2_27_1","unstructured":"P. Moritz R. Nishihara and M. Jordan A linearly-convergent stochastic L-BFGS algorithm in Artificial Intelligence and Statistics PMLR Cadiz Spain 2016 pp. 249\u2013258."},{"key":"e_1_3_2_28_1","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","unstructured":"J. Nocedal and S.J. Wright, Numerical Optimization, 2nd ed., Springer, New York, NY, 2006.","edition":"2"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.11.023"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150116"},{"key":"e_1_3_2_31_1","unstructured":"K.B. Petersen and M.S. Pedersen The matrix cookbook 2012. Version 20121115."},{"key":"e_1_3_2_32_1","volume-title":"Introduction to Optimization","author":"Polyak B.T.","year":"1987","unstructured":"B.T. Polyak, Introduction to Optimization, Optimization Software, New York, 1987."},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_2_34_1","unstructured":"S. Ruder An overview of gradient descent optimization algorithms preprint (2016). Available at arXiv:1609.04747."},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1373190"},{"key":"e_1_3_2_36_1","volume-title":"Optimization for Machine Learning","author":"Sra S.","year":"2012","unstructured":"S. Sra, S. Nowozin, and S.J. Wright, Optimization for Machine Learning, MIT Press, Cambridge, MA, 2012."},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01941-9"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1053141"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90258-X"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1240794"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.23"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1587\/nolta.13.361"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015332"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2025.2475406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T10:24:10Z","timestamp":1776162250000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2025.2475406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,20]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7,4]]}},"alternative-id":["10.1080\/10556788.2025.2475406"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2025.2475406","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,20]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-11-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}