<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-21-3247-1791472117</doi_batch_id>
  <timestamp>20261008150837</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Neutrosophic Science</full_title>
    <abbrev_title>IJNS</abbrev_title>
    <issn media_type="print">2692-6148</issn>
    <issn media_type="electronic">2690-6805</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <journal_volume>
     <volume>25</volume>
    </journal_volume>
    <issue>3</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Modern Free-Derivative Numerical Optimization of Approximate Algorithms Convergence and Neutrosophic Convergence</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Ahmed Sabah Ahmed</given_name>
      <surname>Al-Jilawi</surname>
      <affiliations>
       <institution>
        <institution_name>Department of Mathematics, Faculty of Education College for Pure Sciences, Babylon University, Babylon, Iraq; Department of Mathematical Sciences, College of Liberal Arts and Sciences, Northe</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>The aim of this study is to compare common and previously used numerical algorithms for nonlinear problems under different conditions. This study proposes a parallel implementation of two free derivative optimization methods, Powell's method and Nelder-Mead's method, combined with two restart strategies to achieve a global search. In terms of total time, the Powell method converges faster than the Nelder-Mead method. The final function value obtained by the Powell method is slightly lower. Both are optimization techniques used to find the minimum of an objective function in multidimensional space, without requiring derivatives. Also, we extend our results to apply to some neutrosophic non-linear problems under different neutrosophic-based conditions with many examples that explain the validity of our approach.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2025</year>
    </publication_date>
    <pages>
     <first_page>115</first_page>
     <last_page>122</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">3247</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJNS.250311</doi>
     <resource>https://www.americaspg.com/journal/21/article/3247</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/71731624407.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
