<mets:mets OBJID="eprint_14072" 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:09:53Z"><mets:agent ROLE="CUSTODIAN" TYPE="ORGANIZATION"><mets:name>IIASA Repository</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_eprint_14072_mods"><mets:mdWrap MDTYPE="MODS"><mets:xmlData><mods:titleInfo><mods:title>On the local and global convergence of a reduced Quasi-Newton method1</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">J.-C.</mods:namePart><mods:namePart type="family">Gilbert</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>In optimization in Rn with m nonlinear equality constraints, we study the local convergence of reduced quasi-newton methods, in which the updated matrix is of order n–m. Furthermore, we give necessary and sufficient conditions for superlinear convergence (in one step) and we introduce a device to globalize the local algorithm. It consists in determining a step along an arc in order to decrease an exact penalty function and we give conditions so that asymptotically the step-size will be equal to one. © 1989, Taylor &amp; Francis Group, LLC.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1989</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Taylor and Francis Ltd.</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_eprint_14072"><mets:rightsMD ID="rights_eprint_14072_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_14072_mods" ADMID="TMD_eprint_14072"></mets:div></mets:structMap></mets:mets>