On the performance of switching BFGS/SR1 algorithms for unconstrained optimization

Optimization Methods and Software

Volumn 19, Issue 2, 2004, Pages 153-164

  Al Baali, M ^a   Fuduli, A ^b   Musmanno, R ^c  

^a SULTAN QABOOS UNIVERSITY   (Oman)

^b UNIVERSITY OF SALENTO   (Italy)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

BFGS and SRI updating methods; Switching and extra updating techniques; Unconstrained optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; ITERATIVE METHODS; LINEAR SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

BFGS AND SR1 UPDATING METHODS; SWITCHING AND EXTRA UPDATING TECHNIQUES; UNCONSTRAINED OPTIMIZATION;

NONLINEAR PROGRAMMING;

EID: 1842815281     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780310001625019     Document Type: Article

References (16)

1. R. Fletcher (1987). Practical Methods of Optimization. John Wiley & Sons, New York.
2. R.H. Byrd, D.C. Liu and J. Nocedal (1992). On the behavior of Broyden's class of quasi-Newton methods. SIAM J. Optimization, 2, 533-557.
3. M.J.D. Powell (1986). How bad are the BFGS and DFP methods when the objective function is quadratic? Math. Programming, 34, 34-47.
4. M. Al-Baali (2000). Extra-updates for the BFGS method. Optimization Methods and Software, 13, 159-179.
5. A.R. Conn, N.I.M. Could and Ph.L. Toint (1991). Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Programming, 50, 177-195.
6. H.F. Khalfan, R.H. Byrd and R.B. Schnabel (1993). A theoretical and experimental study of the symmetric rank one update. SIAM J. on Optimization, 3, 1-24.
7. J. Nocedal and S.J. Wright (1999). Numerical Optimization. Springer-Verlag, New York.
8. M. Al-Baali (1994). An efficient class of switching type algorithms in the Broyden family. Optimization Methods and Software, 4, 29-46.
9. J. Nocedal (1980). Updating quasi-Newton matrices with limited storage. Math. Comput., 35, 773-782.
10. D.C. Liu and J. Nocedal (1989). On the limited memory BFGS method for large scale optimization. Math. Programming (series B), 45, 503-528.
11. M. Al-Baali (2002). Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization. Journal of Complexity, 18, 557-572.
12. R. Fletcher (1970). A new approach to variable metric algorithms. Computer J., 13, 317-322.
13. P.T.Boggs and J.W.Tolle(1994). Convergence properties of a class of rank-two updates. SIAM J. on Optimization, 4, 262-287.
14. D.F. Shanno and K.H. Phua (1978). Matrix conditioning and nonlinear optimization. Math. Programming, 14, 149-160.
15. I. Bongartz, A.R. Conn, N.I.M, Gould and Ph.L. Toint (1995). CUTE: constrained and unconstrained testing environment. ACM Transactions on Math. Software, 21, 121-160.
16. E.D. Dolan and J.J. Moré (2002). Benchmarking optimization software with performance profiles. Math. Programming, 91, 201-213.