<mets:mets OBJID="eprint_13623" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mets="http://www.loc.gov/METS/" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mets:metsHdr CREATEDATE="2024-01-01T21:17:56Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_13623_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>A parallel computing scheme for minimizing a class of large scale functions</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">R.</mods:namePart><mods:namePart type="family">Ge</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>This paper gives a parallel computing scheme for minimizing a twice continuously differentiable function with the form ƒf(x) = ∑i = 1mƒi(xi) + ∑i = 1m∑j = 1(j &gt; i)m ƒij(xi, xj),where x = (xT1,…,xTm)T and xi ∈ Rni, ∑mi = 1ni = n, and n a very big number. It is proved that we may use m parallel processors and an iterative procedure to find a minimizer of ƒ(x). The convergence and convergence rate are given under some conditions. The conditions for finding a global minimizer of ƒ(x by using this scheme are given, too. A similar scheme can also be used parallelly to solve a large scale system of nonlinear equations in the similar way. A more general case is also investigated.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1989-04</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Elsevier</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_13623"><mets:rightsMD ID="rights_eprint_13623_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong>
In self-archiving this collection of files and associated bibliographic
metadata, I grant IIASA Repository the right to store
them and to make them permanently available publicly for free on-line.
I declare that this material is my own intellectual property and I
understand that IIASA Repository does not assume any
responsibility if there is any breach of copyright in distributing these
files or metadata. (All authors are urged to prominently assert their
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its
author:</strong> I hereby declare that the collection of files and
associated bibliographic metadata that I am archiving at
IIASA Repository) is in the public domain. If this is
not the case, I accept full responsibility for any breach of copyright
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec></mets:fileSec><mets:structMap><mets:div DMDID="DMD_eprint_13623_mods" ADMID="TMD_eprint_13623"></mets:div></mets:structMap></mets:mets>