메뉴 건너뛰기




Volumn 115, Issue 12, 2011, Pages 1610-1622

Composite splitting algorithms for convex optimization

Author keywords

Composite splitting; Compressive sensing; Convex optimization; Low rank tensor completion; MR image reconstruction

Indexed keywords

COMPOSITE SPLITTING; COMPRESSIVE SENSING; COMPUTATION COMPLEXITY; CONVEX FUNCTIONS; ITERATIVE FRAMEWORK; LOW-RANK TENSOR COMPLETION; MR IMAGES; SPLITTING ALGORITHMS; SUB-PROBLEMS; TENSOR COMPLETION;

EID: 80055061162     PISSN: 10773142     EISSN: 1090235X     Source Type: Journal    
DOI: 10.1016/j.cviu.2011.06.011     Document Type: Article
Times cited : (80)

References (40)
  • 1
    • 36849088522 scopus 로고    scopus 로고
    • Sparse MRI: The application of compressed sensing for rapid MR imaging
    • D.D.M. Lustig, J. Pauly, Sparse MRI: the application of compressed sensing for rapid MR imaging, in: Magnetic Resonance in Medicine, 2007.
    • (2007) Magnetic Resonance in Medicine
    • Lustig, D.D.M.1    Pauly, J.2
  • 2
    • 51949114453 scopus 로고    scopus 로고
    • An efficient algorithm for compressed MR imaging using total variation and wavelets
    • S. Ma, W. Yin, Y. Zhang, A. Chakraborty, An efficient algorithm for compressed MR imaging using total variation and wavelets, in: Proceedings of CVPR, 2008.
    • (2008) Proceedings of CVPR
    • Ma, S.1    Yin, W.2    Zhang, Y.3    Chakraborty, A.4
  • 3
    • 77949723995 scopus 로고    scopus 로고
    • A fast alternating direction method for TVL1-L2 signal reconstruction from partial fourier data
    • J. Yang, Y. Zhang, and W. Yin A fast alternating direction method for TVL1-L2 signal reconstruction from partial fourier data IEEE J. Sel. Top. Signal Process. 4 2 2010 288 297
    • (2010) IEEE J. Sel. Top. Signal Process. , vol.4 , Issue.2 , pp. 288-297
    • Yang, J.1    Zhang, Y.2    Yin, W.3
  • 5
    • 78149326636 scopus 로고    scopus 로고
    • Signal recovery by proximal forward-backward splitting
    • P.L. Combettes, and V.R. Wajs Signal recovery by proximal forward-backward splitting SIAM J. Multiscale Model. Simul. 19 2008 1107 1130
    • (2008) SIAM J. Multiscale Model. Simul. , vol.19 , pp. 1107-1130
    • Combettes, P.L.1    Wajs, V.R.2
  • 6
    • 0033884548 scopus 로고    scopus 로고
    • Modified forward-backward splitting method for maximal monotone mappings
    • P. Tseng A modified forward-backward splitting method for maximal monotone mappings SIAM J. Control Optim. 38 2000 431 446 (Pubitemid 30594547)
    • (2000) SIAM Journal on Control and Optimization , vol.38 , Issue.2 , pp. 431-446
    • Tseng, P.1
  • 7
    • 69649095451 scopus 로고    scopus 로고
    • Fixed-point continuation for L1-minimization: Methodology and convergence
    • E.T. Hale, W. Yin, and Y. Zhang Fixed-point continuation for L1-minimization: methodology and convergence SIAM J. Optim. 19 2008 1107 1130
    • (2008) SIAM J. Optim. , vol.19 , pp. 1107-1130
    • Hale, E.T.1    Yin, W.2    Zhang, Y.3
  • 8
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • A. Beck, and M. Teboulle A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM J. Imaging Sci. 2 1 2009 183 202
    • (2009) SIAM J. Imaging Sci. , vol.2 , Issue.1 , pp. 183-202
    • Beck, A.1    Teboulle, M.2
  • 9
    • 70350593691 scopus 로고    scopus 로고
    • Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems
    • A. Beck, and M. Teboulle Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems IEEE Trans. Image Process. 18 113 2009 2419 2434
    • (2009) IEEE Trans. Image Process. , vol.18 , Issue.113 , pp. 2419-2434
    • Beck, A.1    Teboulle, M.2
  • 10
    • 78049448383 scopus 로고    scopus 로고
    • An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
    • K.-C. Toh, and S. Yun An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems Pacific J. Math. 6 2010 615 640
    • (2010) Pacific J. Math. , vol.6 , pp. 615-640
    • Toh, K.-C.1    Yun, S.2
  • 11
    • 71149103464 scopus 로고    scopus 로고
    • An accelerated gradient method for trace norm minimization
    • S. Ji, J. Ye, An accelerated gradient method for trace norm minimization, in: Proceedings of ICML, 2009.
    • (2009) Proceedings of ICML
    • Ji, S.1    Ye, J.2
  • 12
    • 0001531775 scopus 로고
    • Partial inverse of a monotone operator
    • J.E. Spingarn Partial inverse of a monotone operator Appl. Math. Optim. 10 1983 247 265
    • (1983) Appl. Math. Optim. , vol.10 , pp. 247-265
    • Spingarn, J.E.1
  • 13
    • 77951585455 scopus 로고    scopus 로고
    • General projective splitting methods for sums of maximal monotone operators
    • J. Eckstein, and B.F. Svaiter General projective splitting methods for sums of maximal monotone operators SIAM J. Control Optim. 48 2009 787 811
    • (2009) SIAM J. Control Optim. , vol.48 , pp. 787-811
    • Eckstein, J.1    Svaiter, B.F.2
  • 14
    • 0002211517 scopus 로고
    • A dual algorithm for the solution of nonlinear variational problems via finite-element approximations
    • D. Gabay, and B. Mercier A dual algorithm for the solution of nonlinear variational problems via finite-element approximations Comput. Math. Appl. 2 1976 17 40
    • (1976) Comput. Math. Appl. , vol.2 , pp. 17-40
    • Gabay, D.1    Mercier, B.2
  • 15
    • 0003200255 scopus 로고
    • Augmented Lagrangian and operator-splitting methods in nonlinear mechanics
    • R. Glowinski, and P.L. Tallec Augmented Lagrangian and operator-splitting methods in nonlinear mechanics SIAM Stud. Appl. Math. 9 1989
    • (1989) SIAM Stud. Appl. Math. , vol.9
    • Glowinski, R.1    Tallec, P.L.2
  • 16
    • 0026077016 scopus 로고
    • Applications of a splitting algorithm to decomposition in convex programming and variational inequalities
    • P. Tseng Applications of a splitting algorithm to decomposition in convex programming and variational inequalities SIAM J. Control Optim. 29 1991 119 138
    • (1991) SIAM J. Control Optim. , vol.29 , pp. 119-138
    • Tseng, P.1
  • 17
    • 0242462717 scopus 로고    scopus 로고
    • A new inexact alternating directions method for monotone variational inequalities
    • DOI 10.1007/s101070100280
    • B.S. He, L.-Z. Liao, D. Han, and H. Yang A new inexact alternating direction method for monotone variational inequalities Math. Program. 92 2002 103 118 (Pubitemid 44769742)
    • (2002) Mathematical Programming, Series B , vol.92 , Issue.1 , pp. 103-118
    • He, B.1    Liao, L.-Z.2    Han, D.3    Yang, H.4
  • 18
    • 31744440684 scopus 로고    scopus 로고
    • Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
    • DOI 10.1109/TIT.2005.862083
    • E.J. Candes, J. Romberg, and T. Tao Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inform. Theory 52 2006 489 509 (Pubitemid 43174093)
    • (2006) IEEE Transactions on Information Theory , vol.52 , Issue.2 , pp. 489-509
    • Candes, E.J.1    Romberg, J.2    Tao, T.3
  • 19
    • 33645712892 scopus 로고    scopus 로고
    • Compressed sensing
    • D. Donoho Compressed sensing IEEE Trans. Inform. Theory 52 4 2006 1289 1306
    • (2006) IEEE Trans. Inform. Theory , vol.52 , Issue.4 , pp. 1289-1306
    • Donoho, D.1
  • 20
    • 67651195543 scopus 로고    scopus 로고
    • The Split Bregman Algorithm for L1 Regularized Problems
    • CAM Report 08-29
    • T. Goldstein, S. Osher, The Split Bregman Algorithm for L1 Regularized Problems, Tech. Rep., UCLA, CAM Report 08-29, 2008.
    • (2008) Tech. Rep., UCLA
    • Goldstein, T.1    Osher, S.2
  • 22
    • 78149351664 scopus 로고    scopus 로고
    • Alternating Direction Algorithms for L1-Problems in Compressive Sensing
    • Rice University, TR 09-37
    • J. Yang, Y. Zhang, Alternating Direction Algorithms for L1-Problems in Compressive Sensing, Tech. Rep., Rice University, TR 09-37, 2009.
    • (2009) Tech. Rep.
    • Yang, J.1    Zhang, Y.2
  • 23
    • 69949177588 scopus 로고    scopus 로고
    • An iterative algorithm for linear inverse problems with compound regularizers
    • J.M. Bioucas-Dias, M. Figueiredo, An iterative algorithm for linear inverse problems with compound regularizers, in: Proceedings of ICIP, 2008, pp. 685-688.
    • (2008) Proceedings of ICIP , pp. 685-688
    • Bioucas-Dias, J.M.1    Figueiredo, M.2
  • 24
    • 55349138049 scopus 로고    scopus 로고
    • Iterative algorithms based on decoupling of deblurring and denoising for image restoration
    • Y.-W. Wen, M.K. Ng, and W.-K. Ching Iterative algorithms based on decoupling of deblurring and denoising for image restoration SIAM J. Sci. Comput. 30 5 2008 2655 2674
    • (2008) SIAM J. Sci. Comput. , vol.30 , Issue.5 , pp. 2655-2674
    • Wen, Y.-W.1    Ng, M.K.2    Ching, W.-K.3
  • 25
    • 85012251675 scopus 로고    scopus 로고
    • A new alternating minimization algorithm for total variation image reconstruction
    • Y. Wang, J. Yang, W. Yin, and Y. Zhang A new alternating minimization algorithm for total variation image reconstruction SIAM J. Imaging Sci. 1 2008 248 272
    • (2008) SIAM J. Imaging Sci. , vol.1 , pp. 248-272
    • Wang, Y.1    Yang, J.2    Yin, W.3    Zhang, Y.4
  • 26
    • 79957460815 scopus 로고    scopus 로고
    • Alternating Direction Augmented Lagrangian Methods for Semidefinite Programming
    • Columbia University, New York
    • Z. Wen, D. Goldfarb, W. Yin, Alternating Direction Augmented Lagrangian Methods for Semidefinite Programming, Tech. Rep., Columbia University, New York, 2009.
    • (2009) Tech. Rep.
    • Wen, Z.1    Goldfarb, D.2    Yin, W.3
  • 27
    • 70450212537 scopus 로고    scopus 로고
    • Regularization methods for semidefinite programming
    • J. Malick, J. Povh, F. Rendl, and A. Wiegele Regularization methods for semidefinite programming SIAM J. Optim. 20 2009 336 356
    • (2009) SIAM J. Optim. , vol.20 , pp. 336-356
    • Malick, J.1    Povh, J.2    Rendl, F.3    Wiegele, A.4
  • 30
    • 78149326259 scopus 로고    scopus 로고
    • Fast multiple splitting algorithms for convex optimization
    • Department of IEOR, Columbia University, New York
    • D. Goldfarb, S. Ma, Fast Multiple Splitting Algorithms for Convex Optimization, Tech. Rep., Department of IEOR, Columbia University, New York, 2009.
    • (2009) Tech. Rep.
    • Goldfarb, D.1    Ma, S.2
  • 32
    • 67651063011 scopus 로고    scopus 로고
    • Gradient Methods for Minimizing Composite Objective Function
    • Y.E. Nesterov, Gradient Methods for Minimizing Composite Objective Function, Tech. Rep., 2007. < http://www.ecore.beDPs/dp1191313936.pdf >.
    • (2007) Tech. Rep.
    • Nesterov, Y.E.1
  • 33
    • 62649171652 scopus 로고    scopus 로고
    • A proximal decomposition method for solving convex variational inverse problems
    • P.L. Combettes, and J.-C. Pesquet A proximal decomposition method for solving convex variational inverse problems Inverse Problems 24 2008 1 27
    • (2008) Inverse Problems , vol.24 , pp. 1-27
    • Combettes, P.L.1    Pesquet, J.-C.2
  • 34
    • 73349126993 scopus 로고    scopus 로고
    • Iterative construction of the resolvent of a sum of maximal monotone operators
    • P.L. Combettes Iterative construction of the resolvent of a sum of maximal monotone operators J. Convex Anal. 16 2009 727 748
    • (2009) J. Convex Anal. , vol.16 , pp. 727-748
    • Combettes, P.L.1
  • 35
    • 0003713964 scopus 로고    scopus 로고
    • second ed. Athena Scientific Belmont, Massachusetts
    • D.P. Bertsekas Nonlinear Programming second ed. 1999 Athena Scientific Belmont, Massachusetts
    • (1999) Nonlinear Programming
    • Bertsekas, D.P.1
  • 36
    • 79957968988 scopus 로고    scopus 로고
    • Fixed point and Bregman iterative methods for matrix rank minimization
    • S. Ma, D. Goldfarb, and L. Chen Fixed point and Bregman iterative methods for matrix rank minimization Math. Program. 2009 1 33
    • (2009) Math. Program. , pp. 1-33
    • Ma, S.1    Goldfarb, D.2    Chen, L.3
  • 37
    • 77951291046 scopus 로고    scopus 로고
    • A singular value thresholding algorithm for matrix completion
    • J.-F. Cai, E.J. Candes, and Z. Shen A singular value thresholding algorithm for matrix completion SIAM J. Optim. 20 2010 1956 1982
    • (2010) SIAM J. Optim. , vol.20 , pp. 1956-1982
    • Cai, J.-F.1    Candes, E.J.2    Shen, Z.3
  • 39
    • 85100063855 scopus 로고    scopus 로고
    • Tensor completion for estimating missing values in visual data
    • J. Liu, P. Musialski, P. Wonka, J. Ye, Tensor completion for estimating missing values in visual data, in: Proceedings of ICCV, 2009.
    • (2009) Proceedings of ICCV
    • Liu, J.1    Musialski, P.2    Wonka, P.3    Ye, J.4
  • 40


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