메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 85, Issue 2, 1999, Pages 241-258
A bundle Bregman proximal method for convex nondifferentiable minimization
Author keywords

B functions; Bundle methods bregman functions; Convex programming; Nondifferentiable optimization; Proximal methods
Indexed keywords

EID: 0000813954     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050056     Document Type: Article
Times cited : (21)
References (4)
  • 1
    • 0020702681 scopus 로고
    • Numerical methods for nondifferentiable convex optimization
    • [Aus86]
    • [Aus86] Auslender, A. (1986): Numerical methods for nondifferentiable convex optimization. Math. Program. Stud. 30, 102-126
    • (1986) Math. Program. Stud. , vol.30 , pp. 102-126
    • Auslender, A.1
  • 2
    • 0002403757 scopus 로고    scopus 로고
    • Enlargement of monotone operators with applications to variational inequalities
    • [B1S97]
    • [B1S97] Burachik, R.S., lusem, A.N., Svaiter, B.F. (1997): Enlargement of monotone operators with applications to variational inequalities. Set-Valued Anal. 5, 159-180
    • (1997) Set-Valued Anal. , vol.5 , pp. 159-180
    • Burachik, R.S.1    Lusem, A.N.2    Svaiter, B.F.3
  • 3
    • 0007642615 scopus 로고
    • The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
    • [Bre67] Russian.
    • [Bre67] Bregman, L.M. (1967): The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. Zh. Vychisl. Mat. i Mat. Fiz. 7, 620-631 (Russian).
    • (1967) Zh. Vychisl. Mat. I Mat. Fiz. , vol.7 , pp. 620-631
    • Bregman, L.M.1

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