참고문헌 (30)

1. HH Bauschke 2011 10.1007/978-1-4419-9467-7 Convex Analysis and Monotone Operator Theory in Hilbert Spaces Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011) 

   

2. Found. Trends Mach. Learn. S Boyd 3 1 2011 10.1561/2200000016 Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1-122 (2011) 

   상세보기

3. SIAM J. Optim. JF Cai 20 1956 2010 10.1137/080738970 Cai, J.F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956-1982 (2010) 

   상세보기

4. Ann. Stat. V Chandrasekaran 40 4 1935 2012 10.1214/11-AOS949 Chandrasekaran, V., Parrilo, P., Willsky, A.: Latent variable graphical model selection via convex optimization. Ann. Stat. 40(4), 1935-1967 (2012) 

   상세보기

5. Math. Program. CH Chen 155 1 57 2016 10.1007/s10107-014-0826-5 Chen, C.H., He, B.S., Ye, Y.Y., Yuan, X.M.: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math. Program. 155(1), 57-79 (2016) 

   상세보기

6. Fixed Point Theory Appl. PJ Chen 2016 1 1 2016 10.1186/s13663-015-0491-2 Chen, P.J., Huang, J.G., Zhang, X.Q.: A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions. Fixed Point Theory Appl. 2016(1), 1-18 (2016) 

   상세보기

7. J. Sci. Comput. W Deng 71 2 712 2017 10.1007/s10915-016-0318-2 Deng, W., Lai, M.J., Peng, Z.M., Yin, W.T.: Parallel multi-block ADMM with o $$(1/k)$$ ( 1 / k ) convergence. J. Sci. Comput. 71(2), 712-736 (2017) 

   상세보기

8. 10.21236/ADA567407 Deng, W., Yin, W.T.: On the global and linear convergence of the generalized alternating direction method of multipliers. Rice University CAAM Technical Report TR12-14 (2012) 

   

9. SIAM J. Matrix Anal. Appl. M Fazel 34 946 2013 10.1137/110853996 Fazel, M., Pong, T.K., Sun, D.F., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34, 946-977 (2013) 

   상세보기

10. Comput. Math. Appl. D Gabay 2 17 1976 10.1016/0898-1221(76)90003-1 Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2, 17-40 (1976) 

    상세보기

11. 10.1007/s10957-017-1207-z Gao, B., Ma, F.: Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization. Submitted to J. Optim. Theory Appl. (in revision) (2017) 

    상세보기

12. He, B.S., Yuan, X.M.: On the direct extension of ADMM for multi-block separable convex programming and beyond: from variational inequality perspective, optimization-online (2014) 

13. He, B.S., Ma, F., Yuan, X.M.: Linearized alternating direction method of multipliers via positive-indefinite proximal regularization for convex programming, optimization-online (2016) 

14. He, B.S., Ma, F., Yuan, X.M., Positive-indefinite proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems, optimization-online (2016) 

15. Comput. Optim. Appl. LS Hou 63 1 273 2016 10.1007/s10589-015-9770-4 Hou, L.S., He, H.J., Yang, J.F.: A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA. Comput. Optim. Appl. 63(1), 273-303 (2016) 

    상세보기

16. SIAM J. Optim. M Li 26 2 922 2016 10.1137/140999025 Li, M., Sun, D.F., Toh, K.C.: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization. SIAM J. Optim. 26(2), 922-950 (2016) 

    상세보기

17. SIAM J. Numer. Anal. PL Lions 16 964 1979 10.1137/0716071 Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964-979 (1979) 

    상세보기

18. Appl. Comput. Harmon. Anal. Q Li 32 145 2012 10.1016/j.acha.2011.09.007 Li, Q., Shen, L.X., Yang, L.H.: Split-Bregman iteration for framelet based image inpainting. Appl. Comput. Harmon. Anal. 32, 145-154 (2012) 

    상세보기

19. Journal of Scientific Computing Q Li 70 3 1204 2017 10.1007/s10915-016-0278-6 Li, Q., Xu, Y.S., Zhang, N.: Two-step fixed-point proximity algorithms for multi-block separable convex problems. Journal of Scientific Computing 70(3), 1204-1228 (2017) 

    상세보기

20. Mach. Learn. ZC Lin 95 2 287 2015 10.1007/s10994-014-5469-5 Lin, Z.C., Liu, R.S., Li, H.: Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning. Mach. Learn. 95(2), 287-325 (2015) 

    상세보기

21. Neural Comput. SQ Ma 25 2172 2013 10.1162/NECO_a_00379 Ma, S.Q., Xu, D.Z., Zou, H.: Alternating direction methods for latent variable Gaussian graphical model selection. Neural Comput. 25, 2172-2198 (2013) 

    상세보기

22. J. Sci. Comput. SQ Ma 68 2 546 2016 10.1007/s10915-015-0150-0 Ma, S.Q.: Alternating proximal gradient method for convex minimization. J. Sci. Comput. 68(2), 546-572 (2016) 

    상세보기

23. J. Appl. Math. Comput. M Sun 50 1-2 349 2016 10.1007/s12190-015-0874-x Sun, M., Liu, J.: A proximal Peaceman-Rachford splitting method for compressive sensing. J. Appl. Math. Comput. 50(1-2), 349-363 (2016) 

    상세보기

24. J. Appl. Math. Comput. M Sun 51 1-2 605 2016 10.1007/s12190-015-0922-6 Sun, M., Liu, J.: Generalized Peaceman-Rachford splitting method for separable convex programming with applications to image processing. J. Appl. Math. Comput. 51(1-2), 605-622 (2016) 

    상세보기

25. J. Inequal. Appl. M Sun 2017 19 2017 10.1186/s13660-017-1295-1 Sun, M., Liu, J.: The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization. J. Inequal. Appl. 2017, 19 (2017) 

    상세보기

26. Caocolo M Sun 54 1 77 2017 Sun, M., Wang, Y.J., Liu, J.: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA. Caocolo 54(1), 77-94 (2017) 

27. SIAM J. Optim. M Tao 21 57 2011 10.1137/100781894 Tao, M., Yuan, X.M.: Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J. Optim. 21, 57-81 (2011) 

    상세보기

28. J. Comput. Appl. Math. JJ Wang 309 342 2017 10.1016/j.cam.2016.02.001 Wang, J.J., Song, W.: An algorithm twisted from generalized ADMM for multi-block separable convex minimization models. J. Comput. Appl. Math. 309, 342-358 (2017) 

    상세보기

29. J. Optim. Theory Appl. MH Xu 151 2 321 2011 10.1007/s10957-011-9876-5 Xu, M.H., Wu, T.: A class of linearized proximal alternating direction methods. J. Optim. Theory Appl. 151(2), 321-337 (2011) 

    상세보기

30. J. Sci. Comput. XQ Zhang 6 20 2010 Zhang, X.Q., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on Bregman iteration. J. Sci. Comput. 6, 20-46 (2010)