{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T17:08:39Z","timestamp":1720717719919},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T00:00:00Z","timestamp":1184889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,10,11]]},"DOI":"10.1007\/s10589-007-9043-y","type":"journal-article","created":{"date-parts":[[2007,7,19]],"date-time":"2007-07-19T16:29:37Z","timestamp":1184862577000},"page":"249-259","source":"Crossref","is-referenced-by-count":8,"title":["A bilinear algorithm for sparse representations"],"prefix":"10.1007","volume":"38","author":[{"given":"Pando","family":"Georgiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Theis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,20]]},"reference":[{"key":"9043_CR1","volume-title":"Optimal Control","author":"V.M. Alekseev","year":"1979","unstructured":"Alekseev, V.M., Tihomirov, V.M., Fomin, S.V.: Optimal Control. Nauka, Moscow (1979) (in Russian)"},{"issue":"1","key":"9043_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1008324625522","volume":"16","author":"P.S. Bradley","year":"2000","unstructured":"Bradley, P.S., Mangasarian, O.L.: k-Plane clustering. J.\u00a0Glob. Optim. 16(1), 23\u201332 (2000)","journal-title":"J.\u00a0Glob. Optim."},{"key":"9043_CR3","series-title":"Advances in Neural Information Processing Systems","first-page":"368","volume-title":"Clustering via concave minimization","author":"P.S. Bradley","year":"1997","unstructured":"Bradley, P.S., Mangasarian, O.L., Street, W.N.: Clustering via concave minimization. In: Advances in Neural Information Processing Systems, vol. 9, pp. 368\u2013374. MIT Press, Cambridge (1997). See also Mathematical Programming Technical report 96-03 (May 1996)"},{"issue":"1","key":"9043_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S. Chen","year":"1998","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9043_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0470845899","volume-title":"Adaptive Blind Signal and Image Processing","author":"A. Cichocki","year":"2002","unstructured":"Cichocki, A., Amari, S.: Adaptive Blind Signal and Image Processing. Wiley, Chichester (2002)"},{"issue":"5","key":"9043_CR6","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D. Donoho","year":"2003","unstructured":"Donoho, D., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 minimization. Proc. Natl. Acad. Sci. U.S.A. 100(5), 2197\u20132202 (2003)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"4","key":"9043_CR7","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TNN.2005.849840","volume":"16","author":"P. Georgiev","year":"2005","unstructured":"Georgiev, P., Theis, F., Cichocki, A.: Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Trans. Neural Netw. 16(4), 992\u2013996 (2005)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9043_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/0471221317","volume-title":"Independent Component Analysis","author":"A. Hyv\u00e4rinen","year":"2001","unstructured":"Hyv\u00e4rinen, A., Karhunen, J., Oja, E.: Independent Component Analysis. Wiley, New York (2001)"},{"issue":"4","key":"9043_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/97.752062","volume":"6","author":"T.-W. Lee","year":"1999","unstructured":"Lee, T.-W., Lewicki, M.S., Girolami, M., Sejnowski, T.J.: Blind source separation of more sources than mixtures using overcomplete representaitons. IEEE Signal Process. Lett. 6(4), 87\u201390 (1999)","journal-title":"IEEE Signal Process. Lett."},{"key":"9043_CR10","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"40","author":"D.D. Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 40, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"9043_CR11","unstructured":"Rubinov, A.M., Ugon, J.: Skeletons of finite sets of points. Research working paper 03\/06, School of Information Technology & Mathematical Sciences, University of Ballarat (2003)"},{"key":"9043_CR12","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.neucom.2003.09.008","volume":"56","author":"F.J. Theis","year":"2004","unstructured":"Theis, F.J., Lang, E.W., Puntonet, C.G.: A geometric algorithm for overcomplete linear ICA. Neurocomputing 56, 381\u2013398 (2004)","journal-title":"Neurocomputing"},{"key":"9043_CR13","unstructured":"Waheed, K., Salem, F.: Algebraic overcomplete independent component analysis. In: Proceedings of International Conference ICA 2003, Nara, Japan, pp. 1077\u20131082"},{"issue":"4","key":"9043_CR14","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1162\/089976601300014385","volume":"13","author":"M. Zibulevsky","year":"2001","unstructured":"Zibulevsky, M., Pearlmutter, B.A.: Blind source separation by sparse decomposition in a signal dictionary. Neural Comput. 13(4), 863\u2013882 (2001)","journal-title":"Neural Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9043-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9043-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9043-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:31Z","timestamp":1559288191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9043-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,20]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,10,11]]}},"alternative-id":["9043"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9043-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,20]]}}}