{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:48Z","timestamp":1725490128221},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_12","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:39:15Z","timestamp":1187681955000},"page":"162-176","source":"Crossref","is-referenced-by-count":5,"title":["A Bidirectional Greedy Heuristic for the Subspace Selection Problem"],"prefix":"10.1007","author":[{"given":"Dag","family":"Haugland","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035933","volume-title":"Subset Selection in Regression","author":"A.J. Miller","year":"2002","unstructured":"Miller, A.J.: Subset Selection in Regression, 2nd edn. Chapman and Hall, London, U.K (2002)","edition":"2"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0895479898332928","volume":"21","author":"C. Couvreur","year":"2000","unstructured":"Couvreur, C., Bresler, Y.: On the optimality of the backward greedy algorithm for the subset selection problem. SIAM Journal on Matrix Analysis and Applications\u00a021, 797\u2013808 (2000)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S. Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching Pursuit in a Time-frequency Dictionary. IEEE Transactions on Signal Processing\u00a041, 3397\u20133415 (1993)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal Matching Pursuit: Recursive function approximation with applications to wavelet decomposition. In: Proc. 27th Annu Asilomar Conf. Signals, Systems and Computers, Pacific Grove, CA, pp. 40\u201344 (1993)","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Gharavi-Alkhansari, M., Huang, T.S.: A Fast Orthogonal Matching Pursuit Algorithm. In: Proc. ICASSP 1998, Seattle, Washington, USA, pp. 1389\u20131392 (1998)","DOI":"10.1109\/ICASSP.1998.681706"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B.K Natarajan","year":"1995","unstructured":"Natarajan, B.K: Sparse approximate solutions to linear systems. SIAM J. Comput.\u00a024, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11081-006-6592-3","volume":"7","author":"D. Haugland","year":"2006","unstructured":"Haugland, D., Stor\u00f8y, S.: Local search methods for \u21131-minimization in frame based signal compression. Optimization and Engineering\u00a07, 81\u201396 (2006)","journal-title":"Optimization and Engineering"},{"key":"12_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by Basis Pursuit. SIAM Journal on Scientific Computing\u00a020, 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"12_CR10","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins Univ. Press, Baltimore, MD (1996)","edition":"3"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1109\/97.789606","volume":"6","author":"S.J. Reeves","year":"1999","unstructured":"Reeves, S.J.: An Efficient Implementation of the Backward Greedy Algorithm for Sparse Signal Reconstruction. IEEE Signal Processing Letters\u00a06, 266\u2013268 (1999)","journal-title":"IEEE Signal Processing Letters"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable Neighborhood Search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:27:45Z","timestamp":1619519265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_12","relation":{},"subject":[]}}