{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T03:43:10Z","timestamp":1785901390484,"version":"3.56.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"19","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/tsp.2014.2338077","type":"journal-article","created":{"date-parts":[[2014,7,10]],"date-time":"2014-07-10T18:43:12Z","timestamp":1405017792000},"page":"5046-5058","source":"Crossref","is-referenced-by-count":146,"title":["Optimal Algorithms for &lt;formula formulatype=\"inline\"&gt; &lt;tex Notation=\"TeX\"&gt;$L_{1}$&lt;\/tex&gt;&lt;\/formula&gt;-subspace Signal Processing"],"prefix":"10.1109","volume":"62","author":[{"given":"Panos P.","family":"Markopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George N.","family":"Karystinos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitris A.","family":"Pados","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.04.011"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s101070100233","article-title":"A polynomial case of unconstrained zero-one quadratic optimization","volume":"a 91","author":"allemand","year":"2001","journal-title":"Math Programm"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.903130"},{"key":"ref32","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref31","author":"trees","year":"2001","journal-title":"Detection Estimation and Modulation Theory (Part I)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/S096249291300007X"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048450"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887504"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/4234.917091"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.582823"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(87)90054-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.114"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.07.002"},{"key":"ref13","first-page":"1170","article-title":"L1-norm-based 2DPCA","volume":"40","author":"li","year":"2009","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2009.2020337"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TENCON.2010.5686614"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS636"},{"key":"ref17","first-page":"1433","article-title":"Robust principal component analysis with non-greedy <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_{1}$<\/tex> <\/formula>-norm maximization","author":"nie","year":"2011","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.07.009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TBME.2011.2177523"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2160860"},{"key":"ref4","first-page":"739","article-title":"Robust <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$L_{1}$<\/tex><\/formula> norm factorization in the presence of outliers and missing data by alternative convex programming","author":"ke","year":"2005","journal-title":"Proc IEEE Conf Comput Vision Pattern Recog (CVPR)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.4286571"},{"key":"ref3","author":"ke","year":"2003","journal-title":"Robust subspace computation using L1 norm Internal Technical Report"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2103949"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2002.804527"},{"key":"ref5","first-page":"771","article-title":"Efficient computation of robust low-rank matrix approximations in the presence of missing data using the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$L_{1}$<\/tex><\/formula> norm","author":"eriksson","year":"2010","journal-title":"Proc IEEE Conf Comput Vision Pattern Recog (CVPR)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2012.03.031"},{"key":"ref7","first-page":"1377","article-title":"An efficient algorithm for L1-norm principal component analysis","author":"yu","year":"2012","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process (ICASSP)"},{"key":"ref2","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2012.11.007"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.1986.1143830"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.11.029"},{"key":"ref45","volume":"1","author":"stanley","year":"2012","journal-title":"Enumerative Combinatorics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2206045"},{"key":"ref47","year":"0","journal-title":"L1 code repository"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2012.6467481"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61568-9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.05.016"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/0215024"},{"key":"ref23","first-page":"281","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">$R_{1}$<\/tex> <\/formula>-PCA: Rotational invariant <formula formulatype=\"inline\"><tex Notation=\"TeX\">$L_{1}$<\/tex> <\/formula>-norm principal component analysis for robust subspace factorization","author":"ding","year":"2006","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","author":"magnus","year":"1999","journal-title":"Matrix Differential Calculus with Applications in Statistics and Econometrics"},{"key":"ref26","first-page":"1433","article-title":"Compressive sampling","author":"cand\ufffds","year":"2006","journal-title":"Proc Int Congr Math (ICM)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.028"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/6883253\/06851920.pdf?arnumber=6851920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:52Z","timestamp":1642004932000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6851920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":47,"journal-issue":{"issue":"19"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2014.2338077","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}