Publikation: An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization
Lade...
Dateien
Zu diesem Dokument gibt es keine Dateien.
Datum
2025
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Deutsche Forschungsgemeinschaft (DFG): 432218631
Projekt
Open Access-Veröffentlichung
Open Access Hybrid
Sammlungen
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Mathematical Programming Computation. Springer. ISSN 1867-2949. eISSN 1867-2957. Verfügbar unter: doi: 10.1007/s12532-025-00299-7
Zusammenfassung
In this work, we present an algorithm for computing an enclosure of the nondominated set of multi-objective mixed-integer nonconvex optimization problems. In contrast to existing solvers for this type of problem, this algorithm is not based on a branch-and-bound scheme but rather relies on a relax-and-refine approach. While this is an established technique in single-objective optimization, several adaptions to the multi-objective setting have to be made in order to exploit the full potential of this idea. To that end, we propose an intensified individualization of the relaxations to the respective parts in the image space resulting in a novel adaptive box-based relaxation technique for nonconvex terms. We provide numerical tests for the new algorithm that show both its strengths and limitations.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
510 Mathematik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
EICHFELDER, Gabriele, Moritz LINK, Stefan VOLKWEIN, Leo WARNOW, 2025. An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization. In: Mathematical Programming Computation. Springer. ISSN 1867-2949. eISSN 1867-2957. Verfügbar unter: doi: 10.1007/s12532-025-00299-7BibTex
@article{Eichfelder2025-12-26adapt-75617,
title={An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization},
year={2025},
doi={10.1007/s12532-025-00299-7},
issn={1867-2949},
journal={Mathematical Programming Computation},
author={Eichfelder, Gabriele and Link, Moritz and Volkwein, Stefan and Warnow, Leo}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/75617">
<dc:rights>Attribution 4.0 International</dc:rights>
<dc:contributor>Volkwein, Stefan</dc:contributor>
<dc:language>eng</dc:language>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2026-01-09T11:37:14Z</dcterms:available>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<dc:creator>Volkwein, Stefan</dc:creator>
<dcterms:issued>2025-12-26</dcterms:issued>
<dc:contributor>Warnow, Leo</dc:contributor>
<dc:contributor>Eichfelder, Gabriele</dc:contributor>
<dc:contributor>Link, Moritz</dc:contributor>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dc:creator>Link, Moritz</dc:creator>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2026-01-09T11:37:14Z</dc:date>
<dc:creator>Warnow, Leo</dc:creator>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39"/>
<dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
<bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/75617"/>
<dc:creator>Eichfelder, Gabriele</dc:creator>
<dcterms:title>An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization</dcterms:title>
<dcterms:abstract>In this work, we present an algorithm for computing an enclosure of the nondominated set of multi-objective mixed-integer nonconvex optimization problems. In contrast to existing solvers for this type of problem, this algorithm is not based on a branch-and-bound scheme but rather relies on a relax-and-refine approach. While this is an established technique in single-objective optimization, several adaptions to the multi-objective setting have to be made in order to exploit the full potential of this idea. To that end, we propose an intensified individualization of the relaxations to the respective parts in the image space resulting in a novel adaptive box-based relaxation technique for nonconvex terms. We provide numerical tests for the new algorithm that show both its strengths and limitations.</dcterms:abstract>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Ja
Online First: Zeitschriftenartikel, die schon vor ihrer Zuordnung zu einem bestimmten Zeitschriftenheft (= Issue) online gestellt werden. Online First-Artikel werden auf der Homepage des Journals in der Verlagsfassung veröffentlicht.
