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

M. Al-Baali, A. Fuduli, R. Musmanno*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


This paper studies some possible combinations of the best features of the quasi-Newton symmetric rank-one (SRI), BFGS and extra updating BFGS algorithms for solving nonlinear unconstrained optimization problems. These combinations depend on switching between the BFGS and SRI updates so that certain desirable properties are imposed. The presented numerical results show that the proposed switching algorithm outperforms the robust BFGS method.

Original languageEnglish
Pages (from-to)153-164
Number of pages12
JournalOptimization Methods and Software
Issue number2
Publication statusPublished - Apr 2004


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

ASJC Scopus subject areas

  • Software
  • Control and Optimization
  • Applied Mathematics


Dive into the research topics of 'On the performance of switching BFGS/SR1 algorithms for unconstrained optimization'. Together they form a unique fingerprint.

Cite this