{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:45:17Z","timestamp":1742921117668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181608"},{"type":"electronic","value":"9783319181615"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18161-5_31","type":"book-chapter","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:51:26Z","timestamp":1430383886000},"page":"369-379","source":"Crossref","is-referenced-by-count":5,"title":["A Smoothing Method for Sparse Optimization over Polyhedral Sets"],"prefix":"10.1007","author":[{"given":"Tangi","family":"Migot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mounir","family":"Haddou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: A python package for convex optimization, version 1.1.6. (2013), \n                      cvxopt.org"},{"issue":"10","key":"31_CR2","doi-asserted-by":"publisher","first-page":"5396","DOI":"10.1109\/TSP.2010.2052357","volume":"58","author":"M. Babaie-Zadeh","year":"2010","unstructured":"Babaie-Zadeh, M., Jutten, C.: On the stable recovery of the sparsest overcomplete representations in presence of noise. IEEE Transactions on Signal Processing\u00a058(10), 5396\u20135399 (2010)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"31_CR3","unstructured":"Donoho, D.L.: Neighborly polytopes and sparse solutions of underdetermined linear equations. Tech. rep., Department of Statistics, Stanford University (2004)"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2005.860430","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho, D.L., Elad, M., Temlyakov, V.N.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory\u00a052(1), 6\u201318 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-011-9871-x","volume":"151","author":"G.M. Fung","year":"2011","unstructured":"Fung, G.M., Mangasarian, O.L.: Equivalence of minimal \u21130 and \u2113p norm solutions of linear equalities, inequalities and linear programs for sufficiently small p. Journal of Optimization Theory and Applications\u00a0151(1), 1\u201310 (2011)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Haddou, M., Maheux, P.: Smoothing methods for nonlinear complementarity problems. Journal of Optimization Theory and Applications (2014)","DOI":"10.1007\/s10957-013-0398-1"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Machine learning via polyhedral concave minimization. In: Applied Mathematics and Parallel Computing, pp. 175\u2013188. Springer (1996)","DOI":"10.1007\/978-3-642-99789-1_13"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","volume":"57","author":"H. Mohimani","year":"2009","unstructured":"Mohimani, H., Babaie-Zadeh, M., Jutten, C.: A fast approach for overcomplete sparse decomposition based on smoothed norm. IEEE Transactions on Signal Processing\u00a057(1), 289\u2013301 (2009)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"31_CR9","unstructured":"Rinaldi, F.: Mathematical Programming Methods for minimizing the zero-norm over polyhedral sets. Ph.D. thesis, Sapienza, University of Rome (2009)"}],"container-title":["Advances in Intelligent Systems and Computing","Modelling, Computation and Optimization in Information Systems and Management Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18161-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T09:28:20Z","timestamp":1674206900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18161-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181608","9783319181615"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18161-5_31","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}