<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-07-27T18:52:05Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/56490" metadataPrefix="mods">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/56490</identifier><datestamp>2025-05-23T23:56:00Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_17</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
   <mods:name>
      <mods:namePart>Ivorra, Benjamín Pierre Paul</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Mohammadi, Bijan</mods:namePart>
   </mods:name>
   <mods:name>
      <mods:namePart>Ramos Del Olmo, Ángel Manuel</mods:namePart>
   </mods:name>
   <mods:extension>
      <mods:dateAvailable encoding="iso8601">2023-06-20T16:38:05Z</mods:dateAvailable>
   </mods:extension>
   <mods:extension>
      <mods:dateAccessioned encoding="iso8601">2023-06-20T16:38:05Z</mods:dateAccessioned>
   </mods:extension>
   <mods:originInfo>
      <mods:dateIssued encoding="iso8601">2008</mods:dateIssued>
   </mods:originInfo>
   <mods:identifier type="uri">https://hdl.handle.net/20.500.14352/56490</mods:identifier>
   <mods:identifier type="officialurl">http://www.researchgate.net/publication/254839962_Optimizing_Initial_Guesses_to_Improve_Global_Minimization</mods:identifier>
   <mods:identifier type="relatedurl">http://www.mat.ucm.es/deptos/ma</mods:identifier>
   <mods:abstract>In this paper, we envision global optimization as finding, for a given calculation complexity, a suitable initial guess of a considered optimization algorithm. One can imagine that this possibility clearly improve the capacity of existing optimization algorithms, including stochastic ones. This approach is validated on several large dimension nonlinear minimization problems. Results are compared with those obtained by a geneti algorithm</mods:abstract>
   <mods:language>
      <mods:languageTerm>eng</mods:languageTerm>
   </mods:language>
   <mods:accessCondition type="useAndReproduction">open access</mods:accessCondition>
   <mods:titleInfo>
      <mods:title>Optimizing initial guesses to improve global minimization</mods:title>
   </mods:titleInfo>
   <mods:genre>technical report</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>