메뉴 건너뛰기




Volumn 40, Issue 4, 2002, Pages 1011-1041

Rate of convergence for constrained stochastic approximation algorithms

Author keywords

Constrained stochastic approximation; Rate of convergence; Recursive algorithms; Stochastic approximation; Weak convergence

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTER SIMULATION; CONSTRAINT THEORY; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA; OPTIMIZATION; ORDINARY DIFFERENTIAL EQUATIONS; RANDOM PROCESSES; THEOREM PROVING;

EID: 0036334497     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012999361639     Document Type: Article
Times cited : (26)

References (22)
  • 5
    • 0009937973 scopus 로고    scopus 로고
    • Stochastic approximation: Rate of convergence for constrained algorithms: Asynchronous algorithms and analysis of a competitive resource sharing system
    • Ph.D. thesis, Applied Mathematics Department, Brown University, Providence, RI
    • (2000)
    • Buche, R.1


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