{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T09:11:17Z","timestamp":1732785077279,"version":"3.29.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T00:00:00Z","timestamp":1727136000000},"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":[],"published-print":{"date-parts":[[2024,9,24]]},"DOI":"10.1109\/allerton63246.2024.10735264","type":"proceedings-article","created":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T18:31:52Z","timestamp":1730745112000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Minkowski Descent: An Algorithm for Stochastic Global Optimization"],"prefix":"10.1109","author":[{"given":"Keshav Patel","family":"Keval","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bombay,Department of Electrical Engineering,Mumbai,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vivek Shripad","family":"Borkar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Bombay,Department of Electrical Engineering,Mumbai,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ananya","family":"Singhal","sequence":"additional","affiliation":[{"name":"Quantitative Researcher Open Futures and Commodities Pvt. Ltd.,New Delhi,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.2172\/79972","volume-title":"The MINPACK-2 test problem collection","author":"Averick","year":"1992"},{"key":"ref2","article-title":"Theory of global random search","volume":"65","author":"Zhigljavsky","year":"2012","journal-title":"Springer Science & Business Media"},{"key":"ref3","article-title":"Stochastic global optimization","volume":"9","author":"Zhigljavsky","year":"2007","journal-title":"Springer Science & Business Media"},{"volume-title":"Random search algorithms","year":"2009","author":"Zabinsky","key":"ref4"},{"key":"ref5","first-page":"1","article-title":"Introduction to global optimization","author":"Liberti","year":"2008","journal-title":"Ecole Poly technique"},{"key":"ref6","article-title":"The multi level single linkage method for unconstrained and constrained global optimization","volume":"272327","author":"Rinnooy Kan","year":"1985","journal-title":"Erasmus University Rotterdam, Econometric Institute Archives"},{"issue":"11","key":"ref7","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovic","year":"1997","journal-title":"Computers & Operations Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-28356-0_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1_2"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1011265010691","article-title":"SPT: A stochastic tunneling algorithm for global optimization","volume":"20","author":"Oblow","year":"2001","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"ref11","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10898-004-9966-0","article-title":"On the investigation of stochastic global optimization algorithms","volume":"31","author":"Baritompa","year":"2005","journal-title":"Journal of global optimization"},{"key":"ref12","article-title":"Non-convex preferences and approximate equi-libra","author":"Anderson","year":"2010","journal-title":"Lecture Notes, Economics 201B"},{"key":"ref13","first-page":"317","article-title":"Shapley-Folkman theorem","volume":"4","author":"Starr","year":"2008","journal-title":"The new Palgrave dictio-nary of economics"},{"issue":"1","key":"ref14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4171\/emss\/26","article-title":"The convexification effect of Minkowski summation","volume":"5","author":"Fradelizi","year":"2018","journal-title":"EMS Surveys in Mathematical Sciences"},{"volume-title":"Feature selection & the Shapley-Folkman theorem.","author":"D\u2019Aspremont","key":"ref15"},{"volume-title":"Stochastic Approximation: A Dynamical Systems View-point","year":"2024","author":"Borkar","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s10898-004-9968-y","article-title":"Matching stochastic algorithms to objective function landscapes","volume":"31","author":"Baritompa","year":"2005","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"ref18","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","article-title":"A literature survey of benchmark functions for global optimisation problems","volume":"4","author":"Jamil","year":"2013","journal-title":"International Journal of Mathematical Modelling and Numerical Optimisation"},{"volume-title":"Virtual library of simulation exper-iments: Test functions and datasets","year":"2024","author":"Surjanovic","key":"ref19"},{"issue":"2","key":"ref20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s41745-019-0098-4","article-title":"Stochastic gradient descent and its variants in machine learning","volume":"99","author":"Netrapalli","year":"2019","journal-title":"Journal of the Indian Institute of Science"},{"journal-title":"ADAM: A method for stochastic opti-mization","year":"2014","author":"Kingma","key":"ref21"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/0-306-48056-5_12","article-title":"Multi-start methods","author":"Marti","year":"2003","journal-title":"Handbook of Metaheuristics"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1613\/jair.3313","article-title":"Efficient multi-start strategies for local search algorithms","volume":"41","author":"Gyorgy","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2","key":"ref24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"13","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-1-4757-5362-2_6","article-title":"Simulated annealing algorithms for continuous global optimization","volume-title":"Handbook of Global Optimization","volume":"2","author":"Locatelli","year":"2002"}],"event":{"name":"2024 60th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2024,9,24]]},"location":"Urbana, IL, USA","end":{"date-parts":[[2024,9,27]]}},"container-title":["2024 60th Annual Allerton Conference on Communication, Control, and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10735178\/10735179\/10735264.pdf?arnumber=10735264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T04:52:44Z","timestamp":1732683164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10735264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,24]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/allerton63246.2024.10735264","relation":{},"subject":[],"published":{"date-parts":[[2024,9,24]]}}}