{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:31:41Z","timestamp":1729650701469,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/cdc.2017.8263740","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T15:30:57Z","timestamp":1516721457000},"page":"682-687","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial-time approximation for nonconvex optimization problems with an L1-constraint"],"prefix":"10.1109","author":[{"given":"Yonatan","family":"Mintz","sequence":"first","affiliation":[]},{"given":"Anil","family":"Aswani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Probability in Banach Spaces Isoperimetry and Processes ser A Series of Modern Surveys in Mathematics Series","year":"1991","author":"ledoux","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0825-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.011"},{"journal-title":"The Art of Computer Programming Volume 4A Combinatorial Algorithms","year":"2014","author":"knuth","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.5.400"},{"journal-title":"Lectures in geometric functional analysis","year":"2009","author":"vershynin","key":"ref35"},{"key":"ref34","first-page":"43","article-title":"Gaussian random processes and solid angle measures in Hilbert space","volume":"197","author":"sudakov","year":"1971","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref10","first-page":"1929","article-title":"Dropout: a simple way to prevent neural networks from overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796314240"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1976-0396605-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1978-0500555-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-95322-4_17"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0738"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/120901490"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch118"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2023771"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-014-0198-2"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ejor.2007.01.055","volume":"191","author":"de klerk","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/120901507"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20192-9_9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10928-007-9057-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2004.09.015"},{"key":"ref9","first-page":"275","article-title":"Deep sparse rectifier neural networks","volume":"15","author":"glorot","year":"2011","journal-title":"AISTATS"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.821417"},{"key":"ref20","first-page":"1","article-title":"Mixed-integer quadratic programming is in NP","author":"pia","year":"2016","journal-title":"Mathematical Programming"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201036"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579200"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1050.0169"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"}],"event":{"name":"2017 IEEE 56th Annual Conference on Decision and Control (CDC)","start":{"date-parts":[[2017,12,12]]},"location":"Melbourne, Australia","end":{"date-parts":[[2017,12,15]]}},"container-title":["2017 IEEE 56th Annual Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253407\/8263624\/08263740.pdf?arnumber=8263740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T14:28:20Z","timestamp":1570631300000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8263740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/cdc.2017.8263740","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}