Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition

Noureddine Benrabia, Yamina Laskri, Hamza Guebbai, Mehiddin Al-Baali

Research output: Contribution to journalArticle

Abstract

This article proposes new conjugate gradient method for unconstrained optimization by applying the Powell symmetrical technique in a defined sense. Using the Wolfe line search conditions, the global convergence property of the method is also obtained based on the spectral analysis of the conjugate gradient iteration matrix and the Zoutendijk condition for steepest descent methods. Preliminary numerical results for a set of 86 unconstrained optimization test problems verify the performance of the algorithm and show that the Generalized Descent Symmetrical Hestenes-Stiefel algorithm is competitive with the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP+) algorithms.

Original languageEnglish
Pages (from-to)839-849
Number of pages11
JournalNumerical Functional Analysis and Optimization
Volume37
Issue number7
DOIs
Publication statusPublished - Jul 2 2016

Fingerprint

Conjugate gradient method
Conjugacy
Conjugate Gradient Method
Unconstrained Optimization
Steepest descent method
Steepest Descent Method
Conjugate Gradient
Line Search
Spectral Analysis
Descent
Global Convergence
Convergence Properties
Spectrum analysis
Test Problems
Verify
Optimization Problem
Iteration
Numerical Results

Keywords

  • Conjugate gradient method
  • generalized conjugacy condition
  • global convergence
  • spectral analysis
  • symmetrical technique

ASJC Scopus subject areas

  • Analysis
  • Control and Optimization
  • Signal Processing
  • Computer Science Applications

Cite this

Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition. / Benrabia, Noureddine; Laskri, Yamina; Guebbai, Hamza; Al-Baali, Mehiddin.

In: Numerical Functional Analysis and Optimization, Vol. 37, No. 7, 02.07.2016, p. 839-849.

Research output: Contribution to journalArticle

@article{246012cd054a4606a842cfae7a1059e9,
title = "Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition",
abstract = "This article proposes new conjugate gradient method for unconstrained optimization by applying the Powell symmetrical technique in a defined sense. Using the Wolfe line search conditions, the global convergence property of the method is also obtained based on the spectral analysis of the conjugate gradient iteration matrix and the Zoutendijk condition for steepest descent methods. Preliminary numerical results for a set of 86 unconstrained optimization test problems verify the performance of the algorithm and show that the Generalized Descent Symmetrical Hestenes-Stiefel algorithm is competitive with the Fletcher-Reeves (FR) and Polak-Ribi{\'e}re-Polyak (PRP+) algorithms.",
keywords = "Conjugate gradient method, generalized conjugacy condition, global convergence, spectral analysis, symmetrical technique",
author = "Noureddine Benrabia and Yamina Laskri and Hamza Guebbai and Mehiddin Al-Baali",
year = "2016",
month = "7",
day = "2",
doi = "10.1080/01630563.2016.1178142",
language = "English",
volume = "37",
pages = "839--849",
journal = "Numerical Functional Analysis and Optimization",
issn = "0163-0563",
publisher = "Taylor and Francis Ltd.",
number = "7",

}

TY - JOUR

T1 - Applying the Powell's Symmetrical Technique to Conjugate Gradient Methods with the Generalized Conjugacy Condition

AU - Benrabia, Noureddine

AU - Laskri, Yamina

AU - Guebbai, Hamza

AU - Al-Baali, Mehiddin

PY - 2016/7/2

Y1 - 2016/7/2

N2 - This article proposes new conjugate gradient method for unconstrained optimization by applying the Powell symmetrical technique in a defined sense. Using the Wolfe line search conditions, the global convergence property of the method is also obtained based on the spectral analysis of the conjugate gradient iteration matrix and the Zoutendijk condition for steepest descent methods. Preliminary numerical results for a set of 86 unconstrained optimization test problems verify the performance of the algorithm and show that the Generalized Descent Symmetrical Hestenes-Stiefel algorithm is competitive with the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP+) algorithms.

AB - This article proposes new conjugate gradient method for unconstrained optimization by applying the Powell symmetrical technique in a defined sense. Using the Wolfe line search conditions, the global convergence property of the method is also obtained based on the spectral analysis of the conjugate gradient iteration matrix and the Zoutendijk condition for steepest descent methods. Preliminary numerical results for a set of 86 unconstrained optimization test problems verify the performance of the algorithm and show that the Generalized Descent Symmetrical Hestenes-Stiefel algorithm is competitive with the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP+) algorithms.

KW - Conjugate gradient method

KW - generalized conjugacy condition

KW - global convergence

KW - spectral analysis

KW - symmetrical technique

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

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

U2 - 10.1080/01630563.2016.1178142

DO - 10.1080/01630563.2016.1178142

M3 - Article

VL - 37

SP - 839

EP - 849

JO - Numerical Functional Analysis and Optimization

JF - Numerical Functional Analysis and Optimization

SN - 0163-0563

IS - 7

ER -