Abstract
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 language | English |
|---|---|
| Pages (from-to) | 153-164 |
| Number of pages | 12 |
| Journal | Optimization Methods and Software |
| Volume | 19 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Apr 2004 |
Fingerprint
Keywords
- BFGS and SRI updating methods
- Switching and extra updating techniques
- Unconstrained optimization
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design
- Software
- Applied Mathematics
- Control and Optimization
- Management Science and Operations Research
Cite this
On the performance of switching BFGS/SR1 algorithms for unconstrained optimization. / Al-Baali, M.; Fuduli, A.; Musmanno, R.
In: Optimization Methods and Software, Vol. 19, No. 2, 04.2004, p. 153-164.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - On the performance of switching BFGS/SR1 algorithms for unconstrained optimization
AU - Al-Baali, M.
AU - Fuduli, A.
AU - Musmanno, R.
PY - 2004/4
Y1 - 2004/4
N2 - 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.
AB - 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.
KW - BFGS and SRI updating methods
KW - Switching and extra updating techniques
KW - Unconstrained optimization
UR - http://www.scopus.com/inward/record.url?scp=1842815281&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=1842815281&partnerID=8YFLogxK
U2 - 10.1080/10556780310001625019
DO - 10.1080/10556780310001625019
M3 - Article
VL - 19
SP - 153
EP - 164
JO - Optimization Methods and Software
JF - Optimization Methods and Software
SN - 1055-6788
IS - 2
ER -