메뉴 건너뛰기




Volumn 12, Issue 1, 2002, Pages 109-138

Incremental subgradient methods for nondifferentiable optimization

Author keywords

Convex programming; Incremental subgradient methods; Nondifferentiable optimization; Stochastic subgradient methods

Indexed keywords


EID: 0036342213     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499362111     Document Type: Article
Times cited : (554)

References (39)
  • 11
    • 0009970149 scopus 로고
    • On the stochastic quasi-gradient method and stochastic quasi-Feyer sequences
    • Erm69
    • (1969) Kibernet. , vol.2 , pp. 73-83
    • Ermoliev, Yu.M.1
  • 13
    • 0020498889 scopus 로고
    • Stochastic quasigradient methods and their application to system optimization
    • Erm83
    • (1983) Stochastics , vol.9 , pp. 1-36
    • Ermoliev, Yu.M.1
  • 22
    • 0001518167 scopus 로고
    • On the convergence of the LMS algorithm with adaptive learning rate for linear feedforward networks
    • Luo91
    • (1991) Neural Computation , vol.3 , pp. 226-245
    • Luo, Z.Q.1
  • 37
    • 0032222083 scopus 로고    scopus 로고
    • An incremental gradient(-projection) method with momentum term and adaptive stepsize rule
    • Tse98
    • (1998) SIAM J. Optim. , vol.8 , pp. 506-531
    • Tseng, P.1


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