<?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-28T14:33:07Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/56490" metadataPrefix="qdc">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><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
   <dc:title>Optimizing initial guesses to improve global minimization</dc:title>
   <dc:creator>Ivorra, Benjamín Pierre Paul</dc:creator>
   <dc:creator>Mohammadi, Bijan</dc:creator>
   <dc:creator>Ramos Del Olmo, Ángel Manuel</dc:creator>
   <dcterms: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</dcterms:abstract>
   <dcterms:dateAccepted>2023-06-20T16:38:05Z</dcterms:dateAccepted>
   <dcterms:available>2023-06-20T16:38:05Z</dcterms:available>
   <dcterms:created>2023-06-20T16:38:05Z</dcterms:created>
   <dcterms:issued>2008</dcterms:issued>
   <dc:type>technical report</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/56490</dc:identifier>
   <dc:identifier>XXXX-XXXX</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>MTM2007-64540</dc:relation>
   <dc:relation>Ingenio Matematica (i-MATH) No. CSD2006-00032 (Consolider-Ingenio 2010)</dc:relation>
   <dc:relation>CCG07- UCM/ESP-2787</dc:relation>
   <dc:rights>open access</dc:rights>
   <dc:publisher>Departamento de Matemática Aplicada, Universidad Complutense</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>