<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-information-and-optimization-sciences</journal-id>
      <journal-title-group>
        <journal-title>Journal of Information and Optimization Sciences</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0103</issn>
      <issn publication-format="print">0252-2667</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIOS-1770</article-id>
      <title-group>
        <article-title>A new parameter to enhance three-term conjugate gradient method with inexact line search</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Jardow</surname>
            <given-names>Fanar N.</given-names>
          </name>
          <aff>Department of Environmental Science, College of Environmental Science, University of Mosul, Mosul, Iraq</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Al-Naemi</surname>
            <given-names>Ghada M.</given-names>
          </name>
          <aff>Department of Mathematics, College of Computer Science and Mathematics, University of Mosul, Mosul, Iraq</aff>
        </contrib>
      </contrib-group>
      <volume>46</volume>
      <issue>3</issue>
      <fpage>717</fpage>
      <lpage>727</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>03</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>This Work presents a new parameter for the gradient of the three-term conjugate called (TTFGH) method, the 3T-CG algorithms are quite popular for solving large-scale unconstrained problems Due to their appealing practical qualities, such as their computational simplicity, Strong global convergence properties, better descent property, and reduced memory requirements. By employing Wolfe-Powell (sWP) line search condition, these newly developed methods always satisfy the original condition. The proposed approaches’ global convergence characteristics are indicated by sWP, assuming Lipschitzian continuity of the objective function. Based on numerical results and preliminary comparisons with the of the modern methods, the proposed methods show that they are effective and promising.</p>
      </abstract>
      <kwd-group>
        <kwd>Conjugate gradient</kwd>
        <kwd>Three term</kwd>
        <kwd>Adequate descent property</kwd>
        <kwd>(sWP) line search</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
