<?xml version="1.0" encoding="UTF-8" standalone="yes"?><?xml-stylesheet type="text/xsl" href="/oai-pmh-repository/static/oai2.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
    <responseDate>2026-10-13T12:17:05Z</responseDate>
    <request verb="GetRecord" identifier="oai:data.mendeley.com/nfhfpcmt8r.1" metadataPrefix="oai_dc">https://data.mendeley.com/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>oai:data.mendeley.com/nfhfpcmt8r.1</identifier>
                <datestamp>2008-10-15T11:00:00Z</datestamp>
            </header>
            <metadata><oai_dc:dc xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
    <dc:creator>CPC, Mendeley</dc:creator>
    <dc:title>MinFinder v2.0: An improved version of MinFinder </dc:title>
    <dc:publisher>Elsevier Data Repository</dc:publisher>
    <dc:description>Abstract 
 A new version of the “MinFinder” program is presented that offers an augmented linking procedure for Fortran-77 subprograms, two additional stopping rules and a new start-point rejection mechanism that saves a significant portion of gradient and function evaluations. The method is applied on a set of standard test functions and the results are reported. 
 
 Title of program: MinFinder v2.0
 Catalogue Id: ADWU_v2_0
 
 Nature of problem 
 A multitude of problems in science and engineering are often reduced to minimizing a function of many variables. There are instances that a local optimum does not correspond to the desired physical solution and hence the search for a better solution is required. Local optimization techniques can be trapped in any local minimum. Global optimization is then the appropriate tool. For example, solving a non - linear system of equations via optimization, one may encounter many local minima that do no ...
 
 Versions of this program held in the CPC repository in Mendeley Data
 ADWU_v1_0; MinFinder; 10.1016/j.cpc.2005.10.001
 ADWU_v2_0; MinFinder v2.0; 10.1016/j.cpc.2008.04.016
 
 This program has been imported from the CPC Program Library held at Queen&apos;s University Belfast (1969-2019)</dc:description>
    <dc:subject>Computational Physics</dc:subject>
    <dc:subject>Computational Method</dc:subject>
    <dc:contributor>Tsoulos, Ioannis G.</dc:contributor>
    <dc:contributor>Lagaris, Isaac E.</dc:contributor>
    <dc:type>Dataset</dc:type>
    <dc:identifier>doi:10.17632/nfhfpcmt8r.1</dc:identifier>
    <dc:identifier>oai:data.mendeley.com/nfhfpcmt8r.1</dc:identifier>
    <dc:rights>Computer Physics Communications Journal Licence</dc:rights>
    <dc:rights>https://www.elsevier.com/about/policies/open-access-licenses/elsevier-user-license/cpc-license/</dc:rights>
    <dc:relation>https://elsevier.digitalcommonsdata.com/datasets/nfhfpcmt8r</dc:relation>
    <dc:date>2008-10-15T11:00:00Z</dc:date>
</oai_dc:dc></metadata>
        </record>
    </GetRecord>
</OAI-PMH>
