An augmented filled function for global nonlinear integer optimization

Autores
Di Mauro Aparicio, Juan Pablo; Scolnik, Hugo Daniel
Año de publicación
2020
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions have become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here, we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem (Theorem 4). Numerical results are given showing the efficiency of the new approach.
Fil: Di Mauro Aparicio, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Scolnik, Hugo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Materia
APPROXIMATE ALGORITHMS
DISCRETE FILLED FUNCTION
DISCRETE GLOBAL OPTIMIZATION
NONLINEAR OPTIMIZATION
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/141499
Acceder
id CONICETDig_a1240f7944cdd6c796de145ec33888c6
oai_identifier_str oai:ri.conicet.gov.ar:11336/141499
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An augmented filled function for global nonlinear integer optimizationDi Mauro Aparicio, Juan PabloScolnik, Hugo DanielAPPROXIMATE ALGORITHMSDISCRETE FILLED FUNCTIONDISCRETE GLOBAL OPTIMIZATIONNONLINEAR OPTIMIZATIONhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions have become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here, we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem (Theorem 4). Numerical results are given showing the efficiency of the new approach.Fil: Di Mauro Aparicio, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; ArgentinaFil: Scolnik, Hugo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaSpringer2020-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/141499Di Mauro Aparicio, Juan Pablo; Scolnik, Hugo Daniel; An augmented filled function for global nonlinear integer optimization; Springer; Top; 28; 3; 10-2020; 689-7041134-5764CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s11750-020-00555-0info:eu-repo/semantics/altIdentifier/doi/10.1007/s11750-020-00555-0info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:44:30Zoai:ri.conicet.gov.ar:11336/141499instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:44:31.131CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An augmented filled function for global nonlinear integer optimization
title An augmented filled function for global nonlinear integer optimization
spellingShingle An augmented filled function for global nonlinear integer optimization
Di Mauro Aparicio, Juan Pablo
APPROXIMATE ALGORITHMS
DISCRETE FILLED FUNCTION
DISCRETE GLOBAL OPTIMIZATION
NONLINEAR OPTIMIZATION
title_short An augmented filled function for global nonlinear integer optimization
title_full An augmented filled function for global nonlinear integer optimization
title_fullStr An augmented filled function for global nonlinear integer optimization
title_full_unstemmed An augmented filled function for global nonlinear integer optimization
title_sort An augmented filled function for global nonlinear integer optimization
dc.creator.none.fl_str_mv Di Mauro Aparicio, Juan Pablo
Scolnik, Hugo Daniel
author Di Mauro Aparicio, Juan Pablo
author_facet Di Mauro Aparicio, Juan Pablo
Scolnik, Hugo Daniel
author_role author
author2 Scolnik, Hugo Daniel
author2_role author
dc.subject.none.fl_str_mv APPROXIMATE ALGORITHMS
DISCRETE FILLED FUNCTION
DISCRETE GLOBAL OPTIMIZATION
NONLINEAR OPTIMIZATION
topic APPROXIMATE ALGORITHMS
DISCRETE FILLED FUNCTION
DISCRETE GLOBAL OPTIMIZATION
NONLINEAR OPTIMIZATION
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions have become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here, we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem (Theorem 4). Numerical results are given showing the efficiency of the new approach.
Fil: Di Mauro Aparicio, Juan Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Scolnik, Hugo Daniel. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
description The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions have become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here, we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem (Theorem 4). Numerical results are given showing the efficiency of the new approach.
publishDate 2020
dc.date.none.fl_str_mv 2020-10
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/141499
Di Mauro Aparicio, Juan Pablo; Scolnik, Hugo Daniel; An augmented filled function for global nonlinear integer optimization; Springer; Top; 28; 3; 10-2020; 689-704
1134-5764
CONICET Digital
CONICET
url http://hdl.handle.net/11336/141499
identifier_str_mv Di Mauro Aparicio, Juan Pablo; Scolnik, Hugo Daniel; An augmented filled function for global nonlinear integer optimization; Springer; Top; 28; 3; 10-2020; 689-704
1134-5764
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://link.springer.com/10.1007/s11750-020-00555-0
info:eu-repo/semantics/altIdentifier/doi/10.1007/s11750-020-00555-0
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846082956362252288
score 13.22299

Publicaciones similares