Exact extension of the DIRECT algorithm to multiple objectives
| dc.contributor.author | Lovison, Alberto | |
| dc.contributor.author | Miettinen, Kaisa | |
| dc.contributor.editor | Emmerich, Michael T. M. | |
| dc.contributor.editor | Deutz, André H. | |
| dc.contributor.editor | Hille, Sander C. | |
| dc.contributor.editor | Sergeyev, Yaroslav D. | |
| dc.date.accessioned | 2019-06-11T07:25:47Z | |
| dc.date.available | 2020-02-12T22:35:29Z | |
| dc.date.issued | 2019 | |
| dc.identifier.citation | Lovison, A., & Miettinen, K. (2019). Exact extension of the DIRECT algorithm to multiple objectives. In M. T. M. Emmerich, A. H. Deutz, S. C. Hille, & Y. D. Sergeyev (Eds.), <i>LeGO 2018 : Proceedings of the 14th International Global Optimization Workshop</i> (Article 020053). American Institute of Physics. AIP Conference Proceedings, 2070. <a href="https://doi.org/10.1063/1.5090020" target="_blank">https://doi.org/10.1063/1.5090020</a> | |
| dc.identifier.other | CONVID_28972908 | |
| dc.identifier.other | TUTKAID_80972 | |
| dc.identifier.uri | https://jyx.jyu.fi/handle/123456789/64508 | |
| dc.description.abstract | The direct algorithm has been recognized as an efficient global optimization method which has few requirements of regularity and has proven to be globally convergent in general cases. direct has been an inspiration or has been used as a component for many multiobjective optimization algorithms. We propose an exact and as genuine as possible extension of the direct method for multiple objectives, providing a proof of global convergence (i.e., a guarantee that in an infinite time the algorithm becomes everywhere dense). We test the efficiency of the algorithm on a nonlinear and nonconvex vector function. | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | |
| dc.publisher | American Institute of Physics | |
| dc.relation.ispartof | LeGO 2018 : Proceedings of the 14th International Global Optimization Workshop | |
| dc.relation.ispartofseries | AIP Conference Proceedings | |
| dc.rights | In Copyright | |
| dc.subject.other | monitavoiteoptimointi | fi |
| dc.subject.other | algoritmit | fi |
| dc.subject.other | multi-objective optimisation | fi |
| dc.subject.other | algorithms | fi |
| dc.title | Exact extension of the DIRECT algorithm to multiple objectives | |
| dc.type | conferenceObject | |
| dc.identifier.urn | URN:NBN:fi:jyu-201905292875 | |
| dc.contributor.laitos | Informaatioteknologian tiedekunta | fi |
| dc.contributor.laitos | Faculty of Information Technology | en |
| dc.contributor.oppiaine | Tietotekniikka | fi |
| dc.contributor.oppiaine | Mathematical Information Technology | en |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | |
| dc.date.updated | 2019-05-29T09:15:23Z | |
| dc.relation.isbn | 978-0-7354-1798-4 | |
| dc.type.coar | http://purl.org/coar/resource_type/c_5794 | |
| dc.description.reviewstatus | peerReviewed | |
| dc.relation.issn | 0094-243X | |
| dc.relation.numberinseries | 2070 | |
| dc.type.version | publishedVersion | |
| dc.rights.copyright | © 2019 Author(s). | |
| dc.rights.accesslevel | openAccess | fi |
| dc.relation.conference | International Global Optimization Workshop | |
| dc.relation.grantnumber | 287496 | |
| dc.subject.yso | monitavoiteoptimointi | |
| dc.subject.yso | algoritmit | |
| dc.format.content | fulltext | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p32016 | |
| jyx.subject.uri | http://www.yso.fi/onto/yso/p14524 | |
| dc.rights.url | http://rightsstatements.org/page/InC/1.0/?language=en | |
| dc.relation.doi | 10.1063/1.5090020 | |
| dc.relation.funder | Suomen Akatemia | fi |
| dc.relation.funder | Research Council of Finland | en |
| jyx.fundingprogram | Akatemiahanke, SA | fi |
| jyx.fundingprogram | Academy Project, AoF | en |
| jyx.fundinginformation | This research was partly funded by the Academy of Finland (grant no. 287496). | |
| dc.type.okm | A4 |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as In Copyright