메뉴 건너뛰기




Volumn 3, Issue , 2015, Pages 2444-2452

An asynchronous distributed proximal gradient method for composite convex optimization

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84970028395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (39)

References (22)
  • 1
    • 84865691267 scopus 로고    scopus 로고
    • A first-order augmented lagrangian method for compressed sensing
    • Aybat, N. S. and Iyengar, G. A first-order augmented lagrangian method for compressed sensing. SIAM Journal on Optimization, 22(2):429-459, 2012.
    • (2012) SIAM Journal on Optimization , vol.22 , Issue.2 , pp. 429-459
    • Aybat, N.S.1    Iyengar, G.2
  • 3
    • 84897114481 scopus 로고    scopus 로고
    • A unified approach for minimizing composite norms
    • Aybat, Necdet Serhat and Iyengar, Garud. A unified approach for minimizing composite norms. Mathematical Programming, 144(1-2): 181-226, 2014.
    • (2014) Mathematical Programming , vol.144 , Issue.1-2 , pp. 181-226
    • Aybat, N.S.1    Iyengar, G.2
  • 4
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • March
    • Beck, A. and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Img. Sci., 2(1): 183-202, March 2009. ISSN 1936-4954.
    • (2009) SIAM J. Img. Sci. , vol.2 , Issue.1 , pp. 183-202
    • Beck, A.1    Teboulle, M.2
  • 5
    • 39449100600 scopus 로고    scopus 로고
    • A convergent incremental gradient method with a constant step size
    • Blatt, D., Hero, A., and Gauchman, H. A convergent incremental gradient method with a constant step size. SIAM Journal on Optimization, 18(1):29-51, 2007.
    • (2007) SIAM Journal on Optimization , vol.18 , Issue.1 , pp. 29-51
    • Blatt, D.1    Hero, A.2    Gauchman, H.3
  • 7
    • 84857708133 scopus 로고    scopus 로고
    • Dual averaging for distributed optimization: Convergence analysis and network scaling
    • Duchi, J. C., Agarwal, A., and Wainwright, M. J. Dual averaging for distributed optimization: Convergence analysis and network scaling. IEEE Trans. Automat. Contr., 57(3):592-606, 2012.
    • (2012) IEEE Trans. Automat. Contr. , vol.57 , Issue.3 , pp. 592-606
    • Duchi, J.C.1    Agarwal, A.2    Wainwright, M.J.3
  • 9
    • 0000530103 scopus 로고
    • The laplacian spectrum of a graph, II
    • Grone, R. and Merris, R. The laplacian spectrum of a graph, ii. SIAM J. Discrete Math., 7(2):221-229, 1994.
    • (1994) SIAM J. Discrete Math. , vol.7 , Issue.2 , pp. 221-229
    • Grone, R.1    Merris, R.2
  • 15
    • 58249142419 scopus 로고    scopus 로고
    • Application of a smoothing technique to decomposition in convex optimization
    • Necoara, Ion and Suykens, Johan AK. Application of a smoothing technique to decomposition in convex optimization. Automatic Control, IEEE Transactions on, 53 (11):2674-2679, 2008.
    • (2008) Automatic Control, IEEE Transactions on , vol.53 , Issue.11 , pp. 2674-2679
    • Necoara, I.1    Suykens, J.A.K.2
  • 16
    • 59649103668 scopus 로고    scopus 로고
    • Distributed subgra-dient methods for multi-agent optimization
    • Nedic, Angelia and Ozdaglar, Asuman. Distributed subgra-dient methods for multi-agent optimization. Automatic Control, IEEE Transactions on, 54(1):48-61, 2009.
    • (2009) Automatic Control, IEEE Transactions on , vol.54 , Issue.1 , pp. 48-61
    • Nedic, A.1    Ozdaglar, A.2
  • 17
    • 84865692149 scopus 로고    scopus 로고
    • Efficiency of coordinate descent methods on huge-scale optimization problems
    • Nesterov, Y. Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM Journal on Optimization, 22(2):341-362, 2012.
    • (2012) SIAM Journal on Optimization , vol.22 , Issue.2 , pp. 341-362
    • Nesterov, Y.1
  • 19
    • 84897116612 scopus 로고    scopus 로고
    • Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, forthcoming
    • Series A
    • Richtárik, P. and Takáč, M. Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, forthcoming, Mathematical Programming, Series A, 2012. DOI: 10.1007/sl0107-012-0614-z.
    • (2012) Mathematical Programming
    • Richtárik, P.1    Takáč, M.2
  • 20
    • 70049111607 scopus 로고    scopus 로고
    • On accelerated proximal gradient methods for convex-concave optimization
    • submitted to
    • Tseng, Paul. On accelerated proximal gradient methods for convex-concave optimization, submitted to SIAM Journal on Optimization, 2008.
    • (2008) SIAM Journal on Optimization
    • Tseng, P.1


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