Efficient class of switching type algorithms in the Broyden family

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

In this paper, we extend the switching BFGS/DFP algorithm of Fletcher and the switching BFGS/SR1 algorithm of Al-Baali to a class of swiping type algorithms proposed within the Broyden family of quasi-Newton methods for unconstrained optimization. We propose some members of this class, which switch among the BFGS, the SR1 and other desirable methods from the preconvex class. The switching technique is made in a certain sense upon the basis of estimating the size of the eigenvalues of the Hessian approximation. The results on a set of standard test problems show that several switching methods improve over the BFGS method and work almost similarly to certain idealized methods.

Original languageEnglish
Pages (from-to)29-46
Number of pages18
JournalOptimization Methods and Software
Volume4
Issue number1
Publication statusPublished - 1994

Fingerprint

BFGS Method
Quasi-Newton Method
Unconstrained Optimization
Newton-Raphson method
Test Problems
Switch
Switches
Eigenvalue
Family
Class
Approximation
Standards
Eigenvalues

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Management Science and Operations Research
  • Applied Mathematics
  • Control and Optimization

Cite this

Efficient class of switching type algorithms in the Broyden family. / Al-Baali, Mehiddin.

In: Optimization Methods and Software, Vol. 4, No. 1, 1994, p. 29-46.

Research output: Contribution to journalArticle

@article{2fd7472b381f49008dc6ab47f3762edc,
title = "Efficient class of switching type algorithms in the Broyden family",
abstract = "In this paper, we extend the switching BFGS/DFP algorithm of Fletcher and the switching BFGS/SR1 algorithm of Al-Baali to a class of swiping type algorithms proposed within the Broyden family of quasi-Newton methods for unconstrained optimization. We propose some members of this class, which switch among the BFGS, the SR1 and other desirable methods from the preconvex class. The switching technique is made in a certain sense upon the basis of estimating the size of the eigenvalues of the Hessian approximation. The results on a set of standard test problems show that several switching methods improve over the BFGS method and work almost similarly to certain idealized methods.",
author = "Mehiddin Al-Baali",
year = "1994",
language = "English",
volume = "4",
pages = "29--46",
journal = "Optimization Methods and Software",
issn = "1055-6788",
publisher = "Taylor and Francis Ltd.",
number = "1",

}

TY - JOUR

T1 - Efficient class of switching type algorithms in the Broyden family

AU - Al-Baali, Mehiddin

PY - 1994

Y1 - 1994

N2 - In this paper, we extend the switching BFGS/DFP algorithm of Fletcher and the switching BFGS/SR1 algorithm of Al-Baali to a class of swiping type algorithms proposed within the Broyden family of quasi-Newton methods for unconstrained optimization. We propose some members of this class, which switch among the BFGS, the SR1 and other desirable methods from the preconvex class. The switching technique is made in a certain sense upon the basis of estimating the size of the eigenvalues of the Hessian approximation. The results on a set of standard test problems show that several switching methods improve over the BFGS method and work almost similarly to certain idealized methods.

AB - In this paper, we extend the switching BFGS/DFP algorithm of Fletcher and the switching BFGS/SR1 algorithm of Al-Baali to a class of swiping type algorithms proposed within the Broyden family of quasi-Newton methods for unconstrained optimization. We propose some members of this class, which switch among the BFGS, the SR1 and other desirable methods from the preconvex class. The switching technique is made in a certain sense upon the basis of estimating the size of the eigenvalues of the Hessian approximation. The results on a set of standard test problems show that several switching methods improve over the BFGS method and work almost similarly to certain idealized methods.

UR - http://www.scopus.com/inward/record.url?scp=0028714783&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028714783&partnerID=8YFLogxK

M3 - Article

VL - 4

SP - 29

EP - 46

JO - Optimization Methods and Software

JF - Optimization Methods and Software

SN - 1055-6788

IS - 1

ER -