메뉴 건너뛰기




Volumn 31, Issue 4-5, 1996, Pages 179-186

Minimum curvature multistep quasi-Newton methods

Author keywords

Multistep methods; Quasi Newton methods; Unconstrained optimization

Indexed keywords


EID: 0012321770     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/0898-1221(95)00230-8     Document Type: Article
Times cited : (14)

References (11)
  • 1
    • 0028422546 scopus 로고
    • Multi-step quasi-Newton methods for optimization
    • J.A. Ford and I.A. Moghrabi, Multi-step quasi-Newton methods for optimization, J. Comput. Appl. Math. 50, 305-323 (1994).
    • (1994) J. Comput. Appl. Math. , vol.50 , pp. 305-323
    • Ford, J.A.1    Moghrabi, I.A.2
  • 2
    • 0027902695 scopus 로고
    • Alternative parameter choices for multi-step quasi-Newton methods
    • J.A. Ford and I.A. Moghrabi, Alternative parameter choices for multi-step quasi-Newton methods, Optimization Methods and Software 2, 357-370 (1993).
    • (1993) Optimization Methods and Software , vol.2 , pp. 357-370
    • Ford, J.A.1    Moghrabi, I.A.2
  • 3
    • 0003555964 scopus 로고
    • Further investigation of multi-step quasi-Newton methods
    • J.A. Ford and I.A. Moghrabi, Further investigation of multi-step quasi-Newton methods, Scientia Iranica 1, 327-334 (1995).
    • (1995) Scientia Iranica , vol.1 , pp. 327-334
    • Ford, J.A.1    Moghrabi, I.A.2
  • 4
    • 0001765433 scopus 로고
    • Least change secant updates for quasi-Newton methods
    • J.E. Dennis and R.B. Schnabel, Least change secant updates for quasi-Newton methods, SIAM Review 21, 443-459 (1979).
    • (1979) SIAM Review , vol.21 , pp. 443-459
    • Dennis, J.E.1    Schnabel, R.B.2
  • 6
    • 23644459523 scopus 로고
    • Minimum curvature multi-step quasi-Newton methods for unconstrained optimization
    • University of Essex
    • J.A. Ford and I.A. Moghrabi, Minimum curvature multi-step quasi-Newton methods for unconstrained optimization, University of Essex, Department of Computer Science Technical Report CSM-209 (1994).
    • (1994) Department of Computer Science Technical Report , vol.CSM-209
    • Ford, J.A.1    Moghrabi, I.A.2
  • 7
    • 19944366594 scopus 로고
    • The convergence of a class of double-rank minimization algorithms, Part 2: The new algorithm
    • C.G. Broyden, The convergence of a class of double-rank minimization algorithms, Part 2: The new algorithm, J. Inst. Math. Applic. 6, 222-231 (1970).
    • (1970) J. Inst. Math. Applic. , vol.6 , pp. 222-231
    • Broyden, C.G.1
  • 8
    • 0014825610 scopus 로고
    • A new approach to variable metric algorithms
    • R. Fletcher, A new approach to variable metric algorithms, Comput. J. 13, 317-322 (1970).
    • (1970) Comput. J. , vol.13 , pp. 317-322
    • Fletcher, R.1
  • 9
    • 84966251980 scopus 로고
    • A family of variable metric methods derived by variational means
    • D. Goldfarb, A family of variable metric methods derived by variational means, Math. Comp. 24, 23-26 (1970).
    • (1970) Math. Comp. , vol.24 , pp. 23-26
    • Goldfarb, D.1
  • 10
    • 84968497764 scopus 로고
    • Conditioning of quasi-Newton methods for function minimization
    • D.F. Shanno, Conditioning of quasi-Newton methods for function minimization, Math. Comp. 24, 647-656 (1970).
    • (1970) Math. Comp. , vol.24 , pp. 647-656
    • Shanno, D.F.1


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