메뉴 건너뛰기




Volumn 154, Issue 2, 2012, Pages 536-548

An Accelerated Inexact Proximal Point Algorithm for Convex Minimization

Author keywords

Acceleration; Convex minimization; Inexact; Proximal point algorithm

Indexed keywords

SOFTWARE ENGINEERING;

EID: 84864289740     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-011-9948-6     Document Type: Article
Times cited : (22)

References (11)
  • 1
    • 0000276924 scopus 로고
    • Proximaté et dualité dans un espace Hilbertien
    • Moreau, J. J.: Proximaté et dualité dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273-299 (1965).
    • (1965) Bull. Soc. Math. Fr. , vol.93 , pp. 273-299
    • Moreau, J.J.1
  • 2
    • 0001566816 scopus 로고
    • Regularisation, d'inéquations variationelles par approximations succesives
    • Martinet, B.: Regularisation, d'inéquations variationelles par approximations succesives. Rev. Fra. Inform. Rech. Opér. 4, 154-159 (1970).
    • (1970) Rev. Fra. Inform. Rech. Opér. , vol.4 , pp. 154-159
    • Martinet, B.1
  • 3
    • 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
  • 4
    • 0032202136 scopus 로고    scopus 로고
    • A variable metric proximal point algorithm for monotone operators
    • Burke, J. V., Qian, M. J.: A variable metric proximal point algorithm for monotone operators. SIAM J. Control Optim. 37, 353-375 (1998).
    • (1998) SIAM J. Control Optim. , vol.37 , pp. 353-375
    • Burke, J.V.1    Qian, M.J.2
  • 5
    • 0000680340 scopus 로고    scopus 로고
    • Approximate iterations in Bregman-function-based proximal algorithms
    • Eckstein, J.: Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113-123 (1998).
    • (1998) Math. Program. , vol.83 , pp. 113-123
    • Eckstein, J.1
  • 6
    • 0026123473 scopus 로고
    • On the convergence of the proximal point algorithm for convex minimization
    • Güler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403-419 (1991).
    • (1991) SIAM J. Control Optim. , vol.29 , pp. 403-419
    • Güler, O.1
  • 8
    • 0007016022 scopus 로고
    • New proximal point algorithms for convex minimization
    • Güler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2, 649-664 (1992).
    • (1992) SIAM J. Optim. , vol.2 , pp. 649-664
    • Güler, O.1
  • 10
    • 0010831555 scopus 로고
    • On an approach to the construction of optimal methods of minimization of smooth convex functions
    • Nesterov, Y. E.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Èkon. Mat. Metody 24, 509-517 (1988).
    • (1988) Èkon. Mat. Metody , vol.24 , pp. 509-517
    • Nesterov, Y.E.1
  • 11
    • 85014561619 scopus 로고    scopus 로고
    • A fast iterative shrinkage-thresholding algorithm for linear inverse problems
    • Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183-202 (2009).
    • (2009) SIAM J. Imaging Sci. , vol.2 , pp. 183-202
    • Beck, A.1    Teboulle, M.2


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