메뉴 건너뛰기




Volumn 104, Issue 1, 2013, Pages 1-14

Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures

Author keywords

Linearized alternating direction method with adaptive penalty; Singular value decomposition; Transform invariant low rank texutres; Warm start

Indexed keywords

ADAPTIVE PENALTY; ALGORITHM FOR SOLVING; ALTERNATING DIRECTION METHODS; COMPUTATIONAL COSTS; GUARANTEED CONVERGENCE; SYNTHETIC AND REAL DATA; TRANSFORM INVARIANTS; WARM START;

EID: 84872482934     PISSN: 09205691     EISSN: 15731405     Source Type: Journal    
DOI: 10.1007/s11263-013-0611-6     Document Type: Article
Times cited : (59)

References (24)
  • 2
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • 2600248 1201.90155 10.1137/080738970
    • Cai, J.; Candés, E.; Shen, Z. (2010). A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4), 1956-1982.
    • (2010) SIAM Journal on Optimization , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.1    Candés, E.2    Shen, Z.3
  • 3
    • 79960675858 scopus 로고    scopus 로고
    • Robust principal component analysis?
    • 10.1145/1970392.1970395
    • Candés, E.; Li, X.; Ma, Y.; Wright, J. (2011). Robust principal component analysis? Journal of the ACM, 58(3), 1-37.
    • (2011) Journal of the ACM , vol.58 , Issue.3 , pp. 1-37
    • Candés, E.1    Li, X.2    Ma, Y.3    Wright, J.4
  • 4
    • 0002472542 scopus 로고
    • A proximal-based decomposition method for convex minimization problems
    • 1274173 0823.90097 10.1007/BF01582566
    • Chen, G.; Teboulle, M. (1994). A proximal-based decomposition method for convex minimization problems. Mathematical Programming, 64(1), 81-101.
    • (1994) Mathematical Programming , vol.64 , Issue.1 , pp. 81-101
    • Chen, G.1    Teboulle, M.2
  • 5
    • 84878490420 scopus 로고    scopus 로고
    • On the global and linear convergence of the generalized alternating direction method of multipliers
    • Houston: Rice University
    • 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.
    • (2012) Rice University Technical Report
    • Deng, W.1    Yin, W.2
  • 6
    • 0029307534 scopus 로고
    • De-noising by soft-thresholding
    • 1331258 0820.62002 10.1109/18.382009
    • Donoho, D. (1995). De-noising by soft-thresholding. IEEE Transaction on Information Theory, 41(3), 613-627.
    • (1995) IEEE Transaction on Information Theory , vol.41 , Issue.3 , pp. 613-627
    • Donoho, D.1
  • 7
    • 33646365077 scopus 로고    scopus 로고
    • For most large underdetermined systems of linear equations the minimal ell -1 -norm solution is also the sparsest solution
    • 2217606 10.1002/cpa.20132
    • 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-829.
    • (2004) Communications on Pure and Applied Mathematics , vol.59 , Issue.6 , pp. 797-829
    • Donoho, D.1
  • 8
    • 0032216898 scopus 로고    scopus 로고
    • The geometry of algorithms with orthogonality constraints
    • 1646856 10.1137/S0895479895290954
    • Edelman, A.; Arias, T.; Smith, S. (1999). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20(2), 303-353.
    • (1999) SIAM Journal on Matrix Analysis and Applications , vol.20 , Issue.2 , pp. 303-353
    • Edelman, A.1    Arias, T.2    Smith, S.3
  • 9
    • 84865692854 scopus 로고    scopus 로고
    • Alternating direction method with Gaussian back substitution for separable convex programming
    • 2968856 06081226 10.1137/110822347
    • 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-340.
    • (2012) SIAM Journal on Optimization , vol.22 , Issue.2 , pp. 313-340
    • He, B.1    Tao, M.2    Yuan, X.3
  • 10
    • 77955690054 scopus 로고    scopus 로고
    • The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices
    • Urbana: UIUC
    • 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.
    • (2009) UIUC Technical, Report UILU-ENG-09-2215
    • Lin, Z.1    Chen, M.2    Ma, Y.3
  • 11
    • 85162350693 scopus 로고    scopus 로고
    • Linearized alternating direction method with adaptive penalty for low-rank representation
    • Granada: NIPS
    • 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.
    • (2011) Advances in Neural Information Processing System
    • Lin, Z.1    Liu, R.2    Su, Z.3
  • 15
    • 0021201713 scopus 로고
    • Decomposition through formalization in a product space
    • Pierra, G. (1984). Decomposition through formalization in a product space. Mathematical Programming, 28, 96-115.
    • (1984) Mathematical Programming , vol.28 , pp. 96-115
    • Pierra, G.1
  • 17
    • 78049448383 scopus 로고    scopus 로고
    • An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
    • Toh, K.; Yun, S. (2009). An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. Pacific Journal of Optimization, 6, 615-640.
    • (2009) Pacific Journal of Optimization , vol.6 , pp. 615-640
    • Toh, K.1    Yun, S.2
  • 18
    • 84879905842 scopus 로고    scopus 로고
    • A feasible method for optimization with orthogonality constraints
    • accepted
    • Wen, Z.; Yin, W. (2013). A feasible method for optimization with orthogonality constraints. Mathematical Programming, accepted.
    • (2013) Mathematical Programming
    • Wen, Z.1    Yin, W.2
  • 19
    • 79952307213 scopus 로고    scopus 로고
    • Alternating direction algorithms for l-1 problems in compressive sensing
    • 2783194 1256.65060 10.1137/090777761
    • Yang, J.; Zhang, Y. (2011). Alternating direction algorithms for l-1 problems in compressive sensing. SIAM Journal on Scientific Computing, 33(1), 250-278.
    • (2011) SIAM Journal on Scientific Computing , vol.33 , Issue.1 , pp. 250-278
    • Yang, J.1    Zhang, Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.