{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T08:14:57Z","timestamp":1783757697820,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.orl.2026.107481","type":"journal-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:22:28Z","timestamp":1780590148000},"page":"107481","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Complexity and numerical experiments of a new adaptive generic proximal bundle method"],"prefix":"10.1016","volume":"68","author":[{"given":"Vincent","family":"Guigues","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato D.C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benoit","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0763-5199","authenticated-orcid":false,"given":"Adriana W.","family":"Henarejos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.orl.2026.107481_bib0001","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","article-title":"Universal gradient methods for convex optimization problems","volume":"152","author":"Nesterov","year":"2015","journal-title":"Math. Program."},{"issue":"1-2","key":"10.1016\/j.orl.2026.107481_bib0002","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","article-title":"Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization","volume":"149","author":"Lan","year":"2015","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.orl.2026.107481_bib0003","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/19M1294277","article-title":"An average curvature accelerated composite gradient method for nonconvex smooth composite optimization problems","volume":"31","author":"Liang","year":"2021","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.orl.2026.107481_bib0004","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10589-023-00490-3","article-title":"Average curvature FISTA for nonconvex smooth composite optimization problems","volume":"86","author":"Liang","year":"2023","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.orl.2026.107481_bib0005","series-title":"37th International Conference on Machine Learning (ICLM 2020)","article-title":"Adaptive gradient descent without descent","author":"Mishchenko","year":"2020"},{"key":"10.1016\/j.orl.2026.107481_bib0006","unstructured":"D. Zhou, S. Ma, J. Yang, AdaBB: adaptive Barzilai-Borwein method for convex optimization, (2024). arXiv: 2401.08024."},{"key":"10.1016\/j.orl.2026.107481_bib0007","unstructured":"T. Li, G. Lan, A simple uniformly optimal method without line search for convex optimization, (2023). arXiv: 2310.10082."},{"issue":"4","key":"10.1016\/j.orl.2026.107481_bib0008","doi-asserted-by":"crossref","first-page":"2955","DOI":"10.1137\/20M1327513","article-title":"A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes","volume":"31","author":"Liang","year":"2021","journal-title":"SIAM J. Optim."},{"issue":"2","key":"10.1016\/j.orl.2026.107481_bib0009","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.2023.1372","article-title":"A unified analysis of a class of proximal bundle methods for solving hybrid convex composite optimization problems","volume":"49","author":"Liang","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2026.107481_bib0010","article-title":"Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization","author":"Guigues","year":"2024","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20133","key":"10.1016\/j.orl.2026.107481_bib0011","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","article-title":"New variants of bundle methods","volume":"69","author":"Lemar\u00e9chal","year":"1995","journal-title":"Math. Program."},{"issue":"1-3","key":"10.1016\/j.orl.2026.107481_bib0012","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","article-title":"Proximity control in bundle methods for convex nondifferentiable minimization","volume":"46","author":"Kiwiel","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107481_bib0013","series-title":"Limited Memory BFGS for Nonsmooth Optimization","author":"Skajaa","year":"2010"},{"issue":"1","key":"10.1016\/j.orl.2026.107481_bib0014","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-012-0600-5","article-title":"Composite proximal bundle method","volume":"140","author":"Sagastiz\u00e1bal","year":"2013","journal-title":"Math. Program."},{"issue":"1-2","key":"10.1016\/j.orl.2026.107481_bib0015","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-015-0873-6","article-title":"A doubly stabilized bundle method for nonsmooth convex optimization","volume":"156","author":"de Oliveira","year":"2016","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107481_bib0016","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","article-title":"Convex Analysis and Minimization Algorithms. 2: Advanced Theory and Bundle Methods","author":"Hiriart-Urruty","year":"1993"},{"issue":"4","key":"10.1016\/j.orl.2026.107481_bib0017","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/00207727608941924","article-title":"Non-linear minimax optimization as a sequence of least pTh optimization with finite values of p","volume":"7","author":"Charalambous","year":"1976","journal-title":"Int. J. Syst. Sci."},{"issue":"6","key":"10.1016\/j.orl.2026.107481_bib0018","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1080\/10556780410001689225","article-title":"New limited memory bundle method for large-scale nonsmooth optimization","volume":"19","author":"Haarala","year":"2004","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.orl.2026.107481_bib0019","series-title":"Numerical Optimization: Theoretical and Practical Aspects","year":"2006"},{"issue":"4","key":"10.1016\/j.orl.2026.107481_bib0020","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1137\/0327039","article-title":"An ellipsoid trust region bundle method for nonsmooth convex minimization","volume":"27","author":"Kiwiel","year":"1989","journal-title":"SIAM J. Contr. Optim."},{"key":"10.1016\/j.orl.2026.107481_bib0021","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10107-023-02035-2","article-title":"A single cut proximal bundle method for stochastic convex composite optimization","volume":"208","author":"Liang","year":"2023","journal-title":"Math. Program."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000787?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000787?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T08:09:40Z","timestamp":1783757380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000787"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":21,"alternative-id":["S0167637726000787"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107481","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity and numerical experiments of a new adaptive generic proximal bundle method","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107481","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107481"}}