메뉴 건너뛰기




Volumn 54, Issue 2-3, 2013, Pages 684-695

Error forgetting of Bregman iteration

Author keywords

1 minimization; Augmented Lagrangian method; Bregman iteration; Error forgetting; Method of multipliers; Piece wise linear function; Polyhedral function; Sparse optimization

Indexed keywords

AUGMENTED LAGRANGIAN METHODS; BREGMAN ITERATION; METHOD OF MULTIPLIERS; PIECE-WISE LINEAR FUNCTIONS; SPARSE OPTIMIZATIONS;

EID: 84888094246     PISSN: 08857474     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10915-012-9616-5     Document Type: Article
Times cited : (64)

References (28)
  • 1
    • 19844370110 scopus 로고    scopus 로고
    • An iterative regularization method for total variationbased image restoration
    • Osher, S., Burger, M., Goldfarb, D., Xu, J., Yin, W.: An iterative regularization method for total variationbased image restoration. Multiscale Model. Simul. 4(2), 460-489 (2005)
    • (2005) Multiscale Model. Simul. , vol.4 , Issue.2 , pp. 460-489
    • Osher, S.1    Burger, M.2    Goldfarb, D.3    Xu, J.4    Yin, W.5
  • 2
    • 84977895355 scopus 로고    scopus 로고
    • Bregman iterative algorithms for I1-minimization with applications to compressed sensing
    • Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for I1-minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1(1), 143-168 (2008)
    • (2008) SIAM J. Imaging Sci. , vol.1 , Issue.1 , pp. 143-168
    • Yin, W.1    Osher, S.2    Goldfarb, D.3    Darbon, J.4
  • 3
    • 39449126969 scopus 로고    scopus 로고
    • Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
    • Special Issue on Convex Optimization Methods for Signal Processing
    • Figueiredo, M., Nowak, R., Wright, S. J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 4(1), 586-597 (2007). Special Issue on Convex Optimization Methods for Signal Processing
    • (2007) IEEE J. Sel. Top. Signal Process. , vol.4 , Issue.1 , pp. 586-597
    • Figueiredo, M.1    Nowak, R.2    Wright, S.J.3
  • 4
    • 69649095451 scopus 로고    scopus 로고
    • Fixed-point continuation for l1-minimization: Methodology and convergence
    • Hale, E. T., Yin, W., Zhang, Y: Fixed-point continuation for l1-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107-1130 (2008)
    • (2008) SIAM J. Optim. , vol.19 , Issue.3 , pp. 1107-1130
    • Hale, E.T.1    Yin, W.2    Zhang, Y.3
  • 6
    • 33847715169 scopus 로고    scopus 로고
    • Iterative regularization and nonlinear inverse scale space applied to wavelet-based denoising
    • Xu, J., Osher, S.: Iterative regularization and nonlinear inverse scale space applied to wavelet-based denoising. IEEE Trans. Image Process. 16(2), 534-544 (2006)
    • (2006) IEEE Trans. Image Process. , vol.16 , Issue.2 , pp. 534-544
    • Xu, J.1    Osher, S.2
  • 7
    • 85121572269 scopus 로고    scopus 로고
    • Nonlinear inverse scale space methods
    • Burger, M., Gilboa, G., Osher, S., Xu, J.: Nonlinear inverse scale space methods. Commun. Math. Sci. 4(1), 175-208 (2006)
    • (2006) Commun. Math. Sci. , vol.4 , Issue.1 , pp. 175-208
    • Burger, M.1    Gilboa, G.2    Osher, S.3    Xu, J.4
  • 9
    • 51949109731 scopus 로고    scopus 로고
    • MR image reconstruction by using the iterative refinement method and nonlinear inverse scale space methods
    • He, L., Chang, T.-C, Osher, S., Fang, T., Speier, P.: MR image reconstruction by using the iterative refinement method and nonlinear inverse scale space methods. UCLA CAM Report 06-35 (2006)
    • (2006) UCLA CAM Report 06-35
    • He, L.1    Chang, T.-C.2    Osher, S.3    Fang, T.4    Speier, P.5
  • 10
    • 79957968988 scopus 로고    scopus 로고
    • Fixed point and Bregman iterative methods for matrix rank minimization
    • Ma, S., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Program. pp 1-33 (2009)
    • (2009) Math. Program. , pp. 1-33
    • Ma, S.1    Goldfarb, D.2    Chen, L.3
  • 12
    • 49949144765 scopus 로고
    • The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming
    • Bregman, L.: The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. U. S. S. R. Comput. Math. Math. Phys. 7, 200-217 (1967)
    • (1967) U. S. S. R. Comput. Math. Math. Phys. , vol.7 , pp. 200-217
    • Bregman, L.1
  • 13
    • 67349244805 scopus 로고    scopus 로고
    • Linearized Bregman iterations for compressed sensing
    • Cai, J.-F, Osher, S., Shen, Z.: Linearized Bregman iterations for compressed sensing. Math. Comput. 78(267), 1515-1536 (2008)
    • (2008) Math. Comput. , vol.78 , Issue.267 , pp. 1515-1536
    • Cai, J.-F.1    Osher, S.2    Shen, Z.3
  • 14
    • 70349984018 scopus 로고    scopus 로고
    • Convergence of the linearized Bregman iteration for 1-norm minimization
    • Cai, J.-F, Osher, S., Shen, Z.: Convergence of the linearized Bregman iteration for 1-norm minimization. Math. Comput. 78(268), 2127-2136 (2009)
    • (2009) Math. Comput. , vol.78 , Issue.268 , pp. 2127-2136
    • Cai, J.-F.1    Osher, S.2    Shen, Z.3
  • 15
    • 78651547900 scopus 로고    scopus 로고
    • Analysis and generalizations of the linearized Bregman method
    • Yin, W.: Analysis and generalizations of the linearized Bregman method. SIAM J. Imaging Sci. 3(4), 856-877 (2010)
    • (2010) SIAM J. Imaging Sci. , vol.3 , Issue.4 , pp. 856-877
    • Yin, W.1
  • 16
    • 56749091502 scopus 로고    scopus 로고
    • Exact regularization of convex programs
    • Friedlander, M., Tseng, P.: Exact regularization of convex programs. SIAM J. Optim. 18, 4 (2007)
    • (2007) SIAM J. Optim. , vol.18 , pp. 4
    • Friedlander, M.1    Tseng, P.2
  • 17
    • 84880665211 scopus 로고    scopus 로고
    • Augmented l1 and nuclear-norm models with a globally linearly convergent algorithm
    • Lai, M.-J., Yin, W.: Augmented l1 and nuclear-norm models with a globally linearly convergent algorithm. Rice University CAAM Technical Report TR 12-02 (2012)
    • (2012) Rice University CAAM Technical Report TR 12-02
    • Lai, M.-J.1    Yin, W.2
  • 18
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • Cai, J.-F, Candes, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 2008 (1956-1982)
    • (2008) SIAM J. Optim. , vol.20 , Issue.4 , pp. 1956-1982
    • Cai, J.-F.1    Candes, E.2    Shen, Z.3
  • 19
    • 0014604308 scopus 로고
    • Multiplier and gradient methods
    • Hestenes, M. R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4, 303-320 (1969)
    • (1969) J. Optim. Theory Appl. , vol.4 , pp. 303-320
    • Hestenes, M.R.1
  • 20
    • 0002380692 scopus 로고
    • A method for nonlinear constraints in minimization problems
    • Fletcher, R. ed., Academic Press, New York
    • Powell, M. J. D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283-298. Academic Press, New York (1972)
    • (1972) Optimization , pp. 283-298
    • Powell, M.J.D.1
  • 21
    • 77949275427 scopus 로고    scopus 로고
    • Applications of Lagrangian-based alternating direction methods and connections to split Bregman
    • Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. UCLA CAM Report 09-31 (2009)
    • (2009) UCLA CAM Report 09-31
    • Esser, E.1
  • 22
    • 0016510751 scopus 로고
    • Combined primal-dual and penalty methods for constrained minimization
    • Bertsekas, D. P: Combined primal-dual and penalty methods for constrained minimization. SIAM J. Control 13(3), 521-544 (1975)
    • (1975) SIAM J. Control , vol.13 , Issue.3 , pp. 521-544
    • Bertsekas, D.P.1
  • 25
    • 0016536931 scopus 로고
    • Necessary and sufficient conditions for a penalty method to be exact
    • Bertsekas, D. P: Necessary and sufficient conditions for a penalty method to be exact. Math. Program. 9(1), 87-99 (1975)
    • (1975) Math. Program. , vol.9 , Issue.1 , pp. 87-99
    • Bertsekas, D.P.1
  • 26
    • 0016985417 scopus 로고
    • Monotone operators and the proximal point algorithm
    • Rockafellar, R. T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877-898 (1976)
    • (1976) SIAM J. Control Optim. , vol.14 , pp. 877-898
    • Rockafellar, R.T.1
  • 27
    • 84884669026 scopus 로고    scopus 로고
    • A practical relative error criterion for augmented Lagrangians
    • Eckstein, J., Silva, P. J. S.: A practical relative error criterion for augmented Lagrangians. Math. Program. pp. 1-30 (2010)
    • (2010) Math. Program. , pp. 1-30
    • Eckstein, J.1    Silva, P.J.S.2


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