{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T13:38:45Z","timestamp":1777642725269,"version":"3.51.4"},"reference-count":43,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,7,4]]},"DOI":"10.1080\/10556788.2021.2023522","type":"journal-article","created":{"date-parts":[[2022,2,14]],"date-time":"2022-02-14T09:34:29Z","timestamp":1644831269000},"page":"1415-1446","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions"],"prefix":"10.1080","volume":"37","author":[{"given":"Morteza","family":"Maleknia","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Shamsi","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2022,2,14]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/16M1089897"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4"},{"key":"CIT0003","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"Bonnans J.","year":"2006"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/030601296"},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"J.V. Burke, F.E. Curtis, A.S. Lewis, M.L. Overton, and L.E.A. Sim\u00f5es, Gradient sampling methods for nonsmooth optimization, in Numerical Nonsmooth Optimization: State of the Art Algorithms, Springer International Publishing, Cham, 2020, pp. 201\u2013225.","DOI":"10.1007\/978-3-030-34910-3_6"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/0715011"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1137\/090780201"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.714781"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drz008"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1080\/10556780410001648112"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1080\/10556780410001689225"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-015-9762-4"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1178262"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-017-1160-x"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-018-0030-2"},{"key":"CIT0016","volume-title":"Convex Analysis and Minimization Algorithms II. A Series of Comprehensive Studies in Mathematics","author":"Hiriart-Urruty J.B.","year":"1993"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591907"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0074500"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585731"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1137\/050639673"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74759-0_400"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0514-2"},{"key":"CIT0023","unstructured":"L. Luk\u0161an, M. Tuma, M. Siska, J. Vl\u010dek, and N. Ramesova, Ufo 2002. Interactive system for universal functional optimization, Tech. Rep., Institute of Computer Science, Academy of Sciences of the Czech Republic, 2002."},{"key":"CIT0024","unstructured":"L. Luk\u0161an and J. Vl\u010dek, Test problems for nonsmooth unconstrained and linearly constrained optimization, Tech. Rep., Institute of Computer Science, Academy of Sciences of the Czech Republic, 2000."},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-019-00404-2"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1142\/1493"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-020-01740-8"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00213-y"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1137\/S0036142901389165"},{"key":"CIT0030","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006","edition":"2"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0809-6"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0873-6"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2825-5"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940683"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1145\/363744.363779"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1137\/0802008"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9"},{"key":"CIT0039","unstructured":"M. Skaaja, Limited memory BFGS for nonsmooth optimization, Master's thesis, New York University, 2010."},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939925"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022650107080"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011990503369"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1145\/507338.507355"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2021.2023522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T08:37:42Z","timestamp":1674463062000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2021.2023522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,14]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7,4]]}},"alternative-id":["10.1080\/10556788.2021.2023522"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2021.2023522","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,14]]},"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":"2020-05-26","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}