{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:56:41Z","timestamp":1772297801228,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T00:00:00Z","timestamp":1358985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11263-013-0611-6","type":"journal-article","created":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T11:53:05Z","timestamp":1358941985000},"page":"1-14","source":"Crossref","is-referenced-by-count":58,"title":["Linearized Alternating Direction Method with Adaptive Penalty and Warm Starts for Fast Solving Transform Invariant Low-Rank Textures"],"prefix":"10.1007","volume":"104","author":[{"given":"Xiang","family":"Ren","sequence":"first","affiliation":[]},{"given":"Zhouchen","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,24]]},"reference":[{"key":"611_CR1","unstructured":"Bertsekas, D., & Tsitsiklis, J. (1997). Parallel and distributed computation: Numerical methods. Cambridge: Athena Scientific."},{"issue":"4","key":"611_CR2","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J Cai","year":"2010","unstructured":"Cai, J., Cand\u00e9s, E., & Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956\u20131982.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"611_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"E Cand\u00e9s","year":"2011","unstructured":"Cand\u00e9s, E., Li, X., Ma, Y., & Wright, J. (2011). Robust principal component analysis? Journal of the ACM, 58(3), 1\u201337.","journal-title":"Journal of the ACM"},{"issue":"1","key":"611_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01582566","volume":"64","author":"G Chen","year":"1994","unstructured":"Chen, G., & Teboulle, M. (1994). A proximal-based decomposition method for convex minimization problems. Mathematical Programming, 64(1), 81\u2013101.","journal-title":"Mathematical Programming"},{"key":"611_CR5","doi-asserted-by":"crossref","unstructured":"Deng, W., & Yin, W. (2012). On the global and linear convergence of the generalized alternating direction method of multipliers. Rice University Technical Report. Houston: Rice University.","DOI":"10.21236\/ADA567407"},{"issue":"3","key":"611_CR6","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"D Donoho","year":"1995","unstructured":"Donoho, D. (1995). De-noising by soft-thresholding. IEEE Transaction on Information Theory, 41(3), 613\u2013627.","journal-title":"IEEE Transaction on Information Theory"},{"issue":"6","key":"611_CR7","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D Donoho","year":"2004","unstructured":"Donoho, D. (2004). For most large underdetermined systems of linear equations the minimal $$\\ell _1$$ -norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6), 797\u2013829.","journal-title":"Communications on Pure and Applied Mathematics"},{"issue":"2","key":"611_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1999","unstructured":"Edelman, A., Arias, T., & Smith, S. (1999). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20(2), 303\u2013353.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"611_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., & Yuan, X. (2012). Alternating direction method with Gaussian back substitution for separable convex programming. SIAM Journal on Optimization, 22(2), 313\u2013340.","journal-title":"SIAM Journal on Optimization"},{"key":"611_CR10","unstructured":"Lin, Z., Chen, M., & Ma, Y. (2009). The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical, Report UILU-ENG-09-2215. Urbana: UIUC."},{"key":"611_CR11","unstructured":"Lin, Z., Liu, R., & Su, Z. (2011). Linearized alternating direction method with adaptive penalty for low-rank representation. In Advances in Neural Information Processing System. Granada: NIPS."},{"key":"611_CR12","unstructured":"Liu, G., Lin, Z., & Yu, Y. (2010). Robust subspace segmentation by low-rank representation. In International Conference on Machine Learning. Haifa: ICML."},{"key":"611_CR13","unstructured":"Mobahi, H., Zhou, Z., Yang, A., & Ma, Y. (2011). Holistic 3D reconstruction of urban structures from low-rank textures. In IEEE Workshop on 3D Representation and Recognition (3dRR-11). Barcellona: IEEE."},{"key":"611_CR14","unstructured":"Peng, Y., Ganesh, A., Wright, J., Xu, W., & Ma, Y. (2010). RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images. In IEEE Conference on Computer Vision and Pattern Recognition. San Francisco: IEEE."},{"key":"611_CR15","doi-asserted-by":"crossref","unstructured":"Pierra, G. (1984). Decomposition through formalization in a product space. Mathematical Programming, 28, 96\u2013115.","DOI":"10.1007\/BF02612715"},{"key":"611_CR16","unstructured":"Schindler, G., Krishnamurthy, P., Lublinerman, R., Liu, Y., & Dellaert, F. (2008). Detecting and matching repeated patterns for automatic geo-tagging in urban environments. In IEEE Conference on Computer Vision and Pattern Recognition. Anchorage: IEEE."},{"key":"611_CR17","unstructured":"Toh, K., & Yun, S. (2009). An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization, 6, 615\u2013640."},{"key":"611_CR18","doi-asserted-by":"crossref","unstructured":"Wen, Z., & Yin, W. (2013). A feasible method for optimization with orthogonality constraints. Mathematical Programming, accepted.","DOI":"10.1007\/s10107-012-0584-1"},{"issue":"1","key":"611_CR19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1137\/090777761","volume":"33","author":"J Yang","year":"2011","unstructured":"Yang, J., & Zhang, Y. (2011). Alternating direction algorithms for $$l_1$$ problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1), 250\u2013278.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"611_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Liang, X., & Ma, Y. (2011a). Unwrapping low-rank textures on generalized cylindrical surfaces. In IEEE Conference on Computer Vision and Pattern Recognition. Colorado Springs: IEEE.","DOI":"10.1109\/ICCV.2011.6126388"},{"key":"611_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Matsushita, Y., & Ma, Y. (2011b). Camera calibration with lens distortion from low-rank textures. In IEEE Conference on Computer Vision and Pattern Recognition. Colorado Springs: IEEE.","DOI":"10.1109\/CVPR.2011.5995548"},{"key":"611_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, X., Lin, Z., Sun, F., & Ma, Y. (2012a). Rectification of Chinese characters as transform invariant low-rank textures. Pattern Recognition (submitted to).","DOI":"10.1109\/ICDAR.2013.86"},{"issue":"1","key":"611_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11263-012-0515-x","volume":"99","author":"Z Zhang","year":"2012","unstructured":"Zhang, Z., Ganesh, A., Liang, X., & Ma, Y. (2012b). TILT: Transform-invariant low-rank textures. International Journal of Computer Vision (IJCV), 99(1), 1\u201324.","journal-title":"International Journal of Computer Vision (IJCV)"},{"key":"611_CR24","unstructured":"Zhao, P., & Quan, L. (2011). Translation symmetry detection in a fronto-parallel view. In IEEE Conference on Computer Vision and Pattern Recognition. Colorado Springs: IEEE."}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0611-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-013-0611-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-013-0611-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T16:06:05Z","timestamp":1562601965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-013-0611-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,24]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["611"],"URL":"https:\/\/doi.org\/10.1007\/s11263-013-0611-6","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,24]]}}}