{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:32:39Z","timestamp":1761611559804,"version":"3.37.3"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/lcsys.2023.3286277","type":"journal-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T17:25:55Z","timestamp":1686763555000},"page":"2485-2490","source":"Crossref","is-referenced-by-count":3,"title":["Counter-Examples in First-Order Optimization: A Constructive Approach"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8905-0335","authenticated-orcid":false,"given":"Baptiste","family":"Goujaud","sequence":"first","affiliation":[{"name":"CMAP, Ecole Polytechnique, Institut Polytechnique de Paris, Route de Saclay, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aymeric","family":"Dieuleveut","sequence":"additional","affiliation":[{"name":"CMAP, Ecole Polytechnique, Institut Polytechnique de Paris, Route de Saclay, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Taylor","sequence":"additional","affiliation":[{"name":"Computer Science Department, INRIA Paris, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0653-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/sapm1953321243"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01665-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699598"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263832"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/16M108104X"},{"key":"ref11","first-page":"1","article-title":"Optimal complexity and certification of Bregman first-order methods","volume":"194","author":"dragomir","year":"2021","journal-title":"Math Program"},{"key":"ref33","article-title":"Automated tight Lyapunov analysis for first-order methods","author":"upadhyaya","year":"2023","journal-title":"arXiv 2302 06713"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/19M1281368"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1009-3"},{"key":"ref2","first-page":"4303","article-title":"On lower and upper bounds in smooth and strongly convex optimization","volume":"17","author":"arjevani","year":"2016","journal-title":"J Mach Learn Res"},{"journal-title":"MOSEK optimizer API for C9 3 6","year":"2019","key":"ref1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2023.3286277"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2015.7330562"},{"key":"ref19","article-title":"Optimal first-order methods for convex functions with a quadratic upper bound","author":"goujaud","year":"2022","journal-title":"arXiv 2205 15033"},{"key":"ref18","article-title":"PEPit: Computer-assisted worst-case analyses of first-order optimization methods in python","author":"goujaud","year":"2022","journal-title":"arXiv 2201 04040"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009597"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.006"},{"key":"ref26","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k 2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/00207179208934253"},{"key":"ref20","first-page":"1","article-title":"Gradient descent is optimal under lower restricted secant inequality and upper error bound","author":"guille-escuret","year":"2022","journal-title":"Proc NeurIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1115\/1.3662604"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1115\/1.3662604"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90382-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref29","first-page":"1","article-title":"Lyapunov functions for first-order methods: Tight automated convergence guarantees","author":"taylor","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/9781680839296"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S096249291600009X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-017-0421-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref3","first-page":"1","article-title":"Potential-function proofs for gradient methods","volume":"15","author":"bansal","year":"2019","journal-title":"Theory Comput"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"ref5","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782633\/9828546\/10153415.pdf?arnumber=10153415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,31]],"date-time":"2023-07-31T17:47:26Z","timestamp":1690825646000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10153415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2023.3286277","relation":{},"ISSN":["2475-1456"],"issn-type":[{"type":"electronic","value":"2475-1456"}],"subject":[],"published":{"date-parts":[[2023]]}}}