Skip to main content
Top

2017 | OriginalPaper | Chapter

A New Search Direction for Broyden’s Family Method in Solving Unconstrained Optimization Problems

Authors : Mohd Asrul Hery Ibrahim, Zailani Abdullah, Mohd Ashlyzan Razik, Tutut Herawan

Published in: Recent Advances on Soft Computing and Data Mining

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The conjugate gradient method plays an important role in solving large scale problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Hence, in this paper, we proposed a new hybrid method between conjugate gradient method and quasi-Newton method known as the CG-Broyden method. Then, the new hybrid method is compared with the quasi-Newton methods in terms of the number of iterations and CPU-time using Matlabin Windows 10 which has 4 GB RAM and running using an Intel ® Core ™ i5. Furthermore, the performance profile graphic is used to show the effectiveness of the new hybrid method.. Our numerical analysis provides strong evidence that our CG-Broyden method is more efficient than the ordinary Broyden method Besides, we also prove that the new algorithm is globally convergent.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 2. The new algorithm. IMA J. Appl. Math. 6, 222–231 (1970)MathSciNetCrossRefMATH Broyden, C.G.: The convergence of a class of double-rank minimization algorithms 2. The new algorithm. IMA J. Appl. Math. 6, 222–231 (1970)MathSciNetCrossRefMATH
2.
go back to reference Xu, D.-C.: Global convergence of the Broyden’s class of quasi-newton methods with nonmonotone linesearch. Acta Math. Appl. Sinica Engl. Ser. 19, 19–24 (2003)MathSciNetCrossRefMATH Xu, D.-C.: Global convergence of the Broyden’s class of quasi-newton methods with nonmonotone linesearch. Acta Math. Appl. Sinica Engl. Ser. 19, 19–24 (2003)MathSciNetCrossRefMATH
3.
go back to reference Byrd, R.H., Nocedal, F.: A tool for the analysis of quasi-newton methods with application to unconstrained minimization. SIAM J. Numer. Anal. 26, 727–739 (1989)MathSciNetCrossRefMATH Byrd, R.H., Nocedal, F.: A tool for the analysis of quasi-newton methods with application to unconstrained minimization. SIAM J. Numer. Anal. 26, 727–739 (1989)MathSciNetCrossRefMATH
4.
go back to reference Chong, E.K.P., Zak, S.H.: An Introduction to Optimization, 2nd edn. A Wiley-Interscience Publication, Hoboken (2001)MATH Chong, E.K.P., Zak, S.H.: An Introduction to Optimization, 2nd edn. A Wiley-Interscience Publication, Hoboken (2001)MATH
5.
go back to reference Li, D.-H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15–24 (2001)MathSciNetCrossRefMATH Li, D.-H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15–24 (2001)MathSciNetCrossRefMATH
6.
go back to reference Mamat, M., Mohd, I., June, L.W., Dasril, Y.: Hybrid broyden method for unconstrained optimization. Int. J. Numer. Methods Appl. 1, 121–130 (2009)MathSciNetMATH Mamat, M., Mohd, I., June, L.W., Dasril, Y.: Hybrid broyden method for unconstrained optimization. Int. J. Numer. Methods Appl. 1, 121–130 (2009)MathSciNetMATH
7.
go back to reference Ibrahim, M.A.H., Mamat, M., Sofi, A.Z.M., Mohd, I., Ahmad, W.M.A.W.: Alternative algorithms of broyden familyami: for unconstrained optimization. AIP Conf. Proc. 1309, 670–680 (2010)CrossRef Ibrahim, M.A.H., Mamat, M., Sofi, A.Z.M., Mohd, I., Ahmad, W.M.A.W.: Alternative algorithms of broyden familyami: for unconstrained optimization. AIP Conf. Proc. 1309, 670–680 (2010)CrossRef
8.
go back to reference Sofi, A.Z.M., Mamat, M., Ibrahim, M.A.H.: Reducing computation time in DFP (Davidon, Fletcher & Powell) update method for solving unconstrained optimization problems. AIP Conf. Proc. 1522, 1337–1345 (2013)CrossRef Sofi, A.Z.M., Mamat, M., Ibrahim, M.A.H.: Reducing computation time in DFP (Davidon, Fletcher & Powell) update method for solving unconstrained optimization problems. AIP Conf. Proc. 1522, 1337–1345 (2013)CrossRef
13.
14.
go back to reference Ibrahim, M.A.H., Mamat, M., Leong, W.J.: The hybrid BFGS-CG method in solving unconstrained optimization problems. Abstr. Appl. Anal. 6 (2014) Ibrahim, M.A.H., Mamat, M., Leong, W.J.: The hybrid BFGS-CG method in solving unconstrained optimization problems. Abstr. Appl. Anal. 6 (2014)
15.
go back to reference Andrei, N.: An unconstrained optimization test functions, collection. Adv. Modell. Optimization 10, 147–161 (2008)MathSciNetMATH Andrei, N.: An unconstrained optimization test functions, collection. Adv. Modell. Optimization 10, 147–161 (2008)MathSciNetMATH
16.
go back to reference Zbigniew, M.: Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, Heidelberg (1996)MATH Zbigniew, M.: Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, Heidelberg (1996)MATH
17.
18.
20.
go back to reference Hestenes, M.R., Stiefel, E.: Method of conjugate gradient for solving linear equations. J. Res. Natl. Bur. Stan. 49, 409–436 (1952)CrossRefMATH Hestenes, M.R., Stiefel, E.: Method of conjugate gradient for solving linear equations. J. Res. Natl. Bur. Stan. 49, 409–436 (1952)CrossRefMATH
21.
go back to reference Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: Theory. J. Optim. Theory Appl. 69, 129–137 (1991)MathSciNetCrossRefMATH Liu, Y., Storey, C.: Efficient generalized conjugate gradient algorithms, part 1: Theory. J. Optim. Theory Appl. 69, 129–137 (1991)MathSciNetCrossRefMATH
Metadata
Title
A New Search Direction for Broyden’s Family Method in Solving Unconstrained Optimization Problems
Authors
Mohd Asrul Hery Ibrahim
Zailani Abdullah
Mohd Ashlyzan Razik
Tutut Herawan
Copyright Year
2017
DOI
https://doi.org/10.1007/978-3-319-51281-5_7

Premium Partner