메뉴 건너뛰기




Volumn 17, Issue 4, 2004, Pages 437-442

Convergence property of a class of variable metric methods

Author keywords

Quadratic function; Variable metric methods

Indexed keywords

FUNCTIONS; ITERATIVE METHODS; LINEAR EQUATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

EID: 1842790117     PISSN: 08939659     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-9659(04)90086-9     Document Type: Article
Times cited : (6)

References (10)
  • 2
    • 0006577643 scopus 로고
    • Quasi-Newton algorithms generate identical points
    • L.C.W. Dixon, Quasi-Newton algorithms generate identical points, Mathematical Programming 2, 383-387, (1972).
    • (1972) Mathematical Programming , vol.2 , pp. 383-387
    • Dixon, L.C.W.1
  • 3
    • 0001423485 scopus 로고
    • A tool for analysis of quasi-Newton methods with application to unconstrained minimization
    • R. Byrd and J. Nocedal, A tool for analysis of quasi-Newton methods with application to unconstrained minimization, SIAM Journal on Numerical Analysis 26, 727-739, (1989).
    • (1989) SIAM Journal on Numerical Analysis , vol.26 , pp. 727-739
    • Byrd, R.1    Nocedal, J.2
  • 4
    • 0023427318 scopus 로고
    • Global convergence of a class of quasi-Newton methods with application to unconstrained minimization
    • R. Byrd, J. Nocedal and Y. Yuan, Global convergence of a class of quasi-Newton methods with application to unconstrained minimization, SIAM Journal on Numerical Analysis 24, 1171-1190, (1987).
    • (1987) SIAM Journal on Numerical Analysis , vol.24 , pp. 1171-1190
    • Byrd, R.J.1    Nocedal2    Yuan, Y.3
  • 5
    • 0002855438 scopus 로고
    • Some global convergence properties of a variable metric algorithm for minimization without exact line search
    • (Edited by R.W. Cottle and C.E. Lemke), SIAM, Philadelphia, PA
    • M.J.D. Powell, Some global convergence properties of a variable metric algorithm for minimization without exact line search, In Nonlinear Programming, SIAM-AMS Proceedings, Volume IX, (Edited by R.W. Cottle and C.E. Lemke), SIAM, Philadelphia, PA, (1976).
    • (1976) Nonlinear Programming, SIAM-AMS Proceedings , vol.9
    • Powell, M.J.D.1
  • 6
    • 0027578445 scopus 로고
    • On the global convergence of DFP method
    • D.H. Li, On the global convergence of DFP method, Journal of Hunan University 20 (2), 16-20, (1993).
    • (1993) Journal of Hunan University , vol.20 , Issue.2 , pp. 16-20
    • Li, D.H.1
  • 7
    • 0043263288 scopus 로고    scopus 로고
    • On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables
    • M.J.D. Powell, On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables, Mathematical Programming 87, 281-301, (2000).
    • (2000) Mathematical Programming , vol.87 , pp. 281-301
    • Powell, M.J.D.1
  • 8
    • 0001221773 scopus 로고
    • On the global convergence property of DFP algorithm
    • D.G. Pu and W. Yu, On the global convergence property of DFP algorithm, Annals of Operations Research 24, 175-184, (1990).
    • (1990) Annals of Operations Research , vol.24 , pp. 175-184
    • Pu, D.G.1    Yu, W.2
  • 9
    • 0002663672 scopus 로고
    • Quasi-Newton methods, motivation and theory
    • J.E. Dennis, Jr. and J.J. Moré, Quasi-Newton methods, motivation and theory, SIAM Review 19, 46-89, (1977).
    • (1977) SIAM Review , vol.19 , pp. 46-89
    • Dennis Jr., J.E.1    Moré, J.J.2
  • 10
    • 84966211959 scopus 로고
    • On the global convergence of Broyden's method
    • J.J. Moré, and A. Trangenstein, On the global convergence of Broyden's method, Mathematics of Computation 30, 523-540, (1976).
    • (1976) Mathematics of Computation , vol.30 , pp. 523-540
    • Moré, J.J.1    Trangenstein, A.2


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