메뉴 건너뛰기




Volumn 20, Issue 6, 2005, Pages 679-691

Wide interval for efficient self-scaling quasi-Newton algorithms

Author keywords

Broyden's family; Global and superlinear convergence; Quasi Newton methods; Self scaling; Unconstrained optimization

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PERFORMANCE;

EID: 29744452629     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780410001709448     Document Type: Article
Times cited : (5)

References (22)
  • 2
    • 0000071574 scopus 로고
    • On the behaviour of Broyden's class of quasi-Newton methods
    • Byrd, R., Liu, D. and Nocedal, J., 1992, On the behaviour of Broyden's class of quasi-Newton methods. SIAM Journal on Optimization, 2, 533-557.
    • (1992) SIAM Journal on Optimization , vol.2 , pp. 533-557
    • Byrd, R.1    Liu, D.2    Nocedal, J.3
  • 3
    • 0032373590 scopus 로고    scopus 로고
    • Numerical experience with a class of self-scaling quasi-Newton algorithms
    • Al-Baali, M., 1998, Numerical experience with a class of self-scaling quasi-Newton algorithms. JOTA, 96, 533-553.
    • (1998) JOTA , vol.96 , pp. 533-553
    • Al-Baali, M.1
  • 4
    • 0022470180 scopus 로고
    • How bad are the BFGS and DFP methods when the objective function is quadratic?
    • Powell, M.J.D., 1986, How bad are the BFGS and DFP methods when the objective function is quadratic? Mathematical Programming, 34, 34-47.
    • (1986) Mathematical Programming , vol.34 , pp. 34-47
    • Powell, M.J.D.1
  • 5
    • 0000854843 scopus 로고
    • Quasi-Newton algorithms with updates from the preconvex part of Broyden's family
    • Zhang, Y. and Tewarson, R.P., 1988, Quasi-Newton algorithms with updates from the preconvex part of Broyden's family. IMA Journal of Numerical Analysis, 8, 487-509.
    • (1988) IMA Journal of Numerical Analysis , vol.8 , pp. 487-509
    • Zhang, Y.1    Tewarson, R.P.2
  • 6
    • 0016917827 scopus 로고
    • Optimal conditioning of self-scaling variable metric algorithms
    • Oren, S.S. and Spedicato, E., 1976, Optimal conditioning of self-scaling variable metric algorithms. Mathematical Programming, 10, 70-90.
    • (1976) Mathematical Programming , vol.10 , pp. 70-90
    • Oren, S.S.1    Spedicato, E.2
  • 7
    • 0027648461 scopus 로고
    • Analysis of a self-scaling quasi-Newton method
    • Nocedal, J. andYuan, Y., 1993, Analysis of a self-scaling quasi-Newton method. Mathematical Programming, 61, 19-37.
    • (1993) Mathematical Programming , vol.61 , pp. 19-37
    • Nocedal, J.1    Andyuan, Y.2
  • 8
    • 0015960798 scopus 로고
    • Self-scaling variable metric (SSVM) algorithms I: Criteria and sufficient conditions for scaling a class of algorithms
    • Oren, S.S. and Luenberger, D.G., 1974, Self-scaling variable metric (SSVM) algorithms I: criteria and sufficient conditions for scaling a class of algorithms. Management Science, 20, 845-862.
    • (1974) Management Science , vol.20 , pp. 845-862
    • Oren, S.S.1    Luenberger, D.G.2
  • 9
    • 0031999308 scopus 로고    scopus 로고
    • Analysis of a family of self-scaling quasi-Newton methods
    • Al-Baali, M., 1998, Analysis of a family of self-scaling quasi-Newton methods. Computational. Optimization and Applications, 9, 191-203.
    • (1998) Computational. Optimization and Applications , vol.9 , pp. 191-203
    • Al-Baali, M.1
  • 10
    • 0023427318 scopus 로고
    • Global convergence of a class of quasi-Newton methods on convex problems
    • Byrd, R., Nocedal, J. and Yuan, Y., 1987, Global convergence of a class of quasi-Newton methods on convex problems. SIAM Journal on Numerical Analysis, 24, 1171-1190.
    • (1987) SIAM Journal on Numerical Analysis , vol.24 , pp. 1171-1190
    • Byrd, R.1    Nocedal, J.2    Yuan, Y.3
  • 11
    • 0002855438 scopus 로고
    • Some global convergence properties of a variable metric algorithm for minimization without exact line searches
    • R.W. Cottle and C.E. Lemke (Eds), SIAM-AMS Proceedings, (SIAM Publications)
    • Powell, M.J.D., 1976, Some global convergence properties of a variable metric algorithm for minimization without exact line searches. In: R.W. Cottle and C.E. Lemke (Eds) Nonlinear Programming, SIAM-AMS Proceedings, Vol. IX (SIAM Publications).
    • (1976) Nonlinear Programming , vol.9
    • Powell, M.J.D.1
  • 12
    • 0011306604 scopus 로고
    • On measure functions for the self-scaling updating formulae for quasi-Newton methods
    • Al-Baali, M., 1995, On measure functions for the self-scaling updating formulae for quasi-Newton methods. Optimization, 32, 59-69.
    • (1995) Optimization , vol.32 , pp. 59-69
    • Al-Baali, M.1
  • 13
    • 29744461655 scopus 로고    scopus 로고
    • Globally convergent self-scaling quasi-Newton methods for unconstrained optimization
    • Department of Mathematics and Computer Science, UAE University, United Arab Emirates
    • Al-Baali, M. and Khalfan, H., 2003, Globally convergent self-scaling quasi-Newton methods for unconstrained optimization. Technical Report DMCS 1/03, Department of Mathematics and Computer Science, UAE University, United Arab Emirates.
    • (2003) Technical Report , vol.DMCS 1-03
    • Al-Baali, M.1    Khalfan, H.2
  • 16
    • 0002450905 scopus 로고
    • A theoretical and experimental study of the symmetric rank one update
    • Khalfan, H., Byrd, R.H. and Schnabel, R.B., 1993, A theoretical and experimental study of the symmetric rank one update. SIAM Journal on Optimization, 3, 1-24.
    • (1993) SIAM Journal on Optimization , vol.3 , pp. 1-24
    • Khalfan, H.1    Byrd, R.H.2    Schnabel, R.B.3
  • 18
    • 84966215545 scopus 로고
    • Testing a class of methods for solving minimization problems with simple bounds on the variables
    • Conn, A.R., Gould, N.I.M. and Toint, Ph.L., 1988, Testing a class of methods for solving minimization problems with simple bounds on the variables. Mathematical Computation, 50, 399-430.
    • (1988) Mathematical Computation , vol.50 , pp. 399-430
    • Conn, A.R.1    Gould, N.I.M.2    Toint, Ph.L.3
  • 19
    • 0000387235 scopus 로고
    • A rapidly convergent descent method for minimization
    • Fletcher, R. and Powell, M.J.D., 1963, A rapidly convergent descent method for minimization. Computer Journal, 6, 163-168.
    • (1963) Computer Journal , vol.6 , pp. 163-168
    • Fletcher, R.1    Powell, M.J.D.2
  • 20
    • 0021424838 scopus 로고
    • Some investigations in anew algorithm for nonlinear optimization based on conic models of the objective function
    • Grandinetti, L., 1984, Some investigations in anew algorithm for nonlinear optimization based on conic models of the objective function. JOTA, 43, 1-21.
    • (1984) JOTA , vol.43 , pp. 1-21
    • Grandinetti, L.1
  • 22
    • 0001184391 scopus 로고
    • Matrix conditioning and nonlinear optimization
    • Shanno, D.F. and Phua, K.H., 1978, Matrix conditioning and nonlinear optimization. Mathematical Programming, 14, 149-160.
    • (1978) Mathematical Programming , vol.14 , pp. 149-160
    • Shanno, D.F.1    Phua, K.H.2


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