{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:09:10Z","timestamp":1743066550276,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319616087"},{"type":"electronic","value":"9783319616094"}],"license":[{"start":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T00:00:00Z","timestamp":1509148800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-61609-4_1","type":"book-chapter","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T08:05:02Z","timestamp":1509091502000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Introduction"],"prefix":"10.1007","author":[{"given":"Vishal","family":"Monga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge"},{"issue":"258","key":"1_CR2","first-page":"489","volume":"47","author":"N Wiener","year":"1949","unstructured":"Wiener N (1949) Extrapolation, interpolation, and smoothing of stationary time series: With engineering applications. J Am Stat Assoc 47(258):489\u2013509","journal-title":"J Am Stat Assoc"},{"issue":"4","key":"1_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial time algorithm for linear programming. Combinatorica 4(4):373\u2013395","journal-title":"Combinatorica"},{"key":"1_CR4","volume-title":"Interior-point polynomial methods in convex programming. Society for Industrial and Applied Mathematics","author":"Y Nesterov","year":"1994","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial methods in convex programming. Society for Industrial and Applied Mathematics, Philadelphia, PA"},{"key":"1_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-dual interior-point methods. Society for Industrial and Applied Mathematics","author":"SJ Wright","year":"1997","unstructured":"Wright SJ (1997) Primal-dual interior-point methods. Society for Industrial and Applied Mathematics, Philadelphia, PA"},{"issue":"4","key":"1_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A Forsgren","year":"2002","unstructured":"Forsgren A, Gill PE, Wright MH (2002) Interior methods for nonlinear optimization. SIAM Rev 44(4):525\u2013597","journal-title":"SIAM Rev"},{"issue":"8","key":"1_CR7","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Candes","year":"2006","unstructured":"Candes EJ, Romberg JK, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math 59(8):1207\u20131223","journal-title":"Commun Pure Appl Math"},{"issue":"2","key":"1_CR8","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"J Wright","year":"2009","unstructured":"Wright J, Yang AY, Ganesh A, Sastry SS, Ma Y (2009) Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell 31(2): 210\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"1","key":"1_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imag Sci 2(1):183\u2013202","journal-title":"SIAM J Imag Sci"},{"issue":"6","key":"1_CR10","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"DL Donoho","year":"2006","unstructured":"Donoho DL (2006) For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution. Commun Pure Appl Math 59(6):797\u2013829","journal-title":"Commun Pure Appl Math"},{"issue":"4","key":"1_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/MSP.2007.4286571","volume":"24","author":"RG Baraniuk","year":"2007","unstructured":"Baraniuk RG (2007) Compressive sensing. IEEE Signal Process Mag 24(4):118\u2013121","journal-title":"IEEE Signal Process Mag"},{"key":"1_CR12","first-page":"1","volume-title":"Image super-resolution as sparse representation of raw image patches","author":"J Yang","year":"2008","unstructured":"Yang J, Wright J, Huang T, Ma Y (2008) Image super-resolution as sparse representation of raw image patches. In: Proc. IEEE Conf Comput Vision Pattern Recogn, pp\u00a01\u20138"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Bertalmio M, Sapiro G, Caselles V, Ballester C (2000) Image inpainting. In: Proc. 27th Annual Conf Computer Graph Interactive Tech, pp\u00a0417\u2013424","DOI":"10.1145\/344779.344972"},{"issue":"12","key":"1_CR14","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1109\/TIP.2009.2029593","volume":"18","author":"C-A Deledalle","year":"2009","unstructured":"Deledalle C-A, Denis L, Tupin F (2009) Iterative weighted maximum likelihood denoising with probabilistic patch-based weights. IEEE Trans Image Process 18(12):2661\u20132672","journal-title":"IEEE Trans Image Process"},{"issue":"12","key":"1_CR15","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"15","author":"M Elad","year":"2006","unstructured":"Elad M, Aharon M (2006) Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans Image Process 15(12): 3736\u20133745","journal-title":"IEEE Trans Image Process"},{"issue":"5","key":"1_CR16","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Candes","year":"2010","unstructured":"Candes EJ, Tao T (2010) The power of convex relaxation: near-optimal matrix completion. IEEE Trans Inf Theory 56(5):2053\u20132080","journal-title":"IEEE Trans Inf Theory"},{"key":"1_CR17","first-page":"612","volume-title":"Background subtraction using low rank and group sparsity constraints","author":"X Cui","year":"2012","unstructured":"Cui X, Huang J, Zhang S, Metaxas DN (2012) Background subtraction using low rank and group sparsity constraints. In: Proc. European Conf Comput Vision. Springer, Berlin, pp\u00a0612\u2013625"},{"key":"1_CR18","first-page":"482","volume-title":"European Conf Comput Vision","author":"X Liang","year":"2012","unstructured":"Liang X, Ren X, Zhang Z, Ma Y (2012) Repairing sparse low-rank texture. In: Proc. European Conf Comput Vision. Springer, Berlin, pp\u00a0482\u2013495"},{"key":"1_CR19","volume-title":"Sequential quadratic programming","author":"J Nocedal","year":"2006","unstructured":"Nocedal J, Wright SJ (2006) Sequential quadratic programming. Springer, Berlin"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs PT, Tolle JW (1995) Sequential quadratic programming. Acta Numer 4:1\u201351","journal-title":"Acta Numer"},{"issue":"5\u20136","key":"1_CR21","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes EJ, Wakin MB, Boyd SP (2008) Enhancing sparsity by reweighted l1 minimization. J Fourier Anal Appl 14(5\u20136):877\u2013905","journal-title":"J Fourier Anal Appl"},{"issue":"11","key":"1_CR22","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1109\/LSP.2015.2438255","volume":"22","author":"HS Mousavi","year":"2015","unstructured":"Mousavi HS, Monga V, Tran TD (2015) Iterative convex refinement for sparse recovery. IEEE Signal Process Lett 22(11):1903\u20131907","journal-title":"IEEE Signal Process Lett"},{"issue":"14","key":"1_CR23","doi-asserted-by":"crossref","first-page":"3760","DOI":"10.1109\/TSP.2016.2552501","volume":"64","author":"O Aldayel","year":"2016","unstructured":"Aldayel O, Monga V, Rangaswamy M (2016) Successive QCQP refinement for MIMO radar waveform design under practical constraints. IEEE Trans Signal Process 64(14):3760\u20133774","journal-title":"IEEE Trans Signal Process"},{"issue":"6","key":"1_CR24","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1109\/TIP.2015.2409572","volume":"24","author":"U Srinivas","year":"2015","unstructured":"Srinivas U, Suo Y, Dao M, Monga V, Tran TD (2015) Structured sparse priors for image classification. IEEE Trans Image Process 24(6):1763\u20131776","journal-title":"IEEE Trans Image Process"}],"container-title":["Handbook of Convex Optimization Methods in Imaging Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61609-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T09:59:21Z","timestamp":1518515961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61609-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,28]]},"ISBN":["9783319616087","9783319616094"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61609-4_1","relation":{},"subject":[],"published":{"date-parts":[[2017,10,28]]}}}