메뉴 건너뛰기




Volumn , Issue , 2000, Pages

Second-order information in the adaptive search exploration algorithm

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84894307595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (15)
  • 1
    • 0013468071 scopus 로고
    • A Variable Metric Algorithm for Unconstrained Minimization Without Evaluation of Derivatives
    • J. Brauninger, A Variable Metric Algorithm for Unconstrained Minimization Without Evaluation of Derivatives, Numerische Mathematik 36, 1981, pp. 359-373
    • (1981) Numerische Mathematik , vol.36 , pp. 359-373
    • Brauninger, J.1
  • 2
    • 0242609515 scopus 로고    scopus 로고
    • Recent Progress in Unconstrained Nonlinear Optimization without Derivatives
    • A.R. Conn, K. Scheiberg, Ph.L. Toint, Recent Progress in Unconstrained Nonlinear Optimization without Derivatives, Mathematical Programming 79, 1997, pp. 397-414
    • (1997) Mathematical Programming , vol.79 , pp. 397-414
    • Conn, A.R.1    Scheiberg, K.2    Toint, P.L.3
  • 3
    • 84894308469 scopus 로고
    • edited by E. Spedicato, Kluwer Academic Publishers
    • L.W.C. Dixon, Neural Networks and Unconstrained Optimization, in Algorithms for Continuous Optimization: The state of the Art, edited by E. Spedicato, Kluwer Academic Publishers, 1994
    • (1994) Neural Networks and Unconstrained Optimization
    • Dixon, L.W.C.1
  • 7
    • 34249767550 scopus 로고
    • Second-order Necessary and Sufficient Conditions in Nonsmooth Optimization
    • L.R. Huang, K.F. Ng, Second-order Necessary and Sufficient Conditions in Nonsmooth Optimization, Mathematical Programming 66, 1994, pp. 379-402
    • (1994) Mathematical Programming , vol.66 , pp. 379-402
    • Huang, L.R.1    Ng, K.F.2
  • 9
    • 0016538991 scopus 로고
    • A Superlinearly Convergent Algorithm for Minimization Without Evaluation Derivatives
    • R. Mifflin, A Superlinearly Convergent Algorithm for Minimization Without Evaluation Derivatives, Mathematical Programming 9, 1975, pp. 100-117
    • (1975) Mathematical Programming 9 , pp. 100-117
    • Mifflin, R.1
  • 10
    • 0001008029 scopus 로고
    • An Efficient Method for Finding the Minimum of a Function of Several Variables Without Calculating Derivatives
    • M.J.D. Powell, An Efficient Method for Finding the Minimum of a Function of Several Variables Without Calculating Derivatives, Computer Journal 7, 1964, pp.155-163
    • (1964) Computer Journal , vol.7 , pp. 155-163
    • Powell, M.J.D.1
  • 11
    • 0013466347 scopus 로고
    • A Method of Minimizing Functions Without Computing Derivatives
    • B.N. Psenicny, A Method of Minimizing Functions Without Computing Derivatives, Doklady Akademie SSSR 235, 1977, pp. 1097-1100
    • (1977) Doklady Akademie SSSR , vol.235 , pp. 1097-1100
    • Psenicny, B.N.1
  • 12
    • 0002912764 scopus 로고
    • A Modification of Davidon's Minimization Method to Accept Difference Approximation of Derivatives
    • G.W. Stewart, A Modification of Davidon's Minimization Method to Accept Difference Approximation of Derivatives, Journal of the Association for Computing Machinery 14-1, 1967, pp. 72-83
    • (1967) Journal of the Association For Computing Machinery , vol.1-14 , pp. 72-83
    • Stewart, G.W.1
  • 13
    • 0031540855 scopus 로고    scopus 로고
    • On the Convergence of Pattern Search Methods
    • V. Torczon, On the Convergence of Pattern Search Methods, SIAM Journal on Optimization 7, 1997, pp. 1-25
    • (1997) SIAM Journal On Optimization , vol.7 , pp. 1-25
    • Torczon, V.1


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