TU Darmstadt / ULB / TUbiblio

The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities

Schmidt, Martin ; Sirvent, Mathias ; Wollner, Winnifried (2022)
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities.
In: Optimization Letters, 16 (5)
doi: 10.1007/s11590-021-01827-9
Artikel, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

It is folklore knowledge that nonconvex mixed-integer nonlinear optimization problems can be notoriously hard to solve in practice. In this paper we go one step further and drop analytical properties that are usually taken for granted in mixed-integer nonlinear optimization. First, we only assume Lipschitz continuity of the nonlinear functions and additionally consider multivariate implicit constraint functions that cannot be solved for any parameter analytically. For this class of mixed-integer problems we propose a novel algorithm based on an approximation of the feasible set in the domain of the nonlinear function—in contrast to an approximation of the graph of the function considered in prior work. This method is shown to compute approximate global optimal solutions in finite time and we also provide a worst-case iteration bound. In some first numerical experiments we show that the “cost of not knowing enough” is rather high by comparing our approach with the open-source global solver SCIP. This reveals that a lot of work is still to be done for this highly challenging class of problems and we thus finally propose some possible directions of future research.

Typ des Eintrags: Artikel
Erschienen: 2022
Autor(en): Schmidt, Martin ; Sirvent, Mathias ; Wollner, Winnifried
Art des Eintrags: Bibliographie
Titel: The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities
Sprache: Englisch
Publikationsjahr: Juni 2022
Ort: Berlin ; Heidelberg
Verlag: Springer
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Optimization Letters
Jahrgang/Volume einer Zeitschrift: 16
(Heft-)Nummer: 5
DOI: 10.1007/s11590-021-01827-9
Zugehörige Links:
Kurzbeschreibung (Abstract):

It is folklore knowledge that nonconvex mixed-integer nonlinear optimization problems can be notoriously hard to solve in practice. In this paper we go one step further and drop analytical properties that are usually taken for granted in mixed-integer nonlinear optimization. First, we only assume Lipschitz continuity of the nonlinear functions and additionally consider multivariate implicit constraint functions that cannot be solved for any parameter analytically. For this class of mixed-integer problems we propose a novel algorithm based on an approximation of the feasible set in the domain of the nonlinear function—in contrast to an approximation of the graph of the function considered in prior work. This method is shown to compute approximate global optimal solutions in finite time and we also provide a worst-case iteration bound. In some first numerical experiments we show that the “cost of not knowing enough” is rather high by comparing our approach with the open-source global solver SCIP. This reveals that a lot of work is still to be done for this highly challenging class of problems and we thus finally propose some possible directions of future research.

Freie Schlagworte: Mixed-integer nonlinear optimization, Global optimization, Lipschitz optimization, Gas networks
Sachgruppe der Dewey Dezimalklassifikatin (DDC): 500 Naturwissenschaften und Mathematik > 510 Mathematik
Fachbereich(e)/-gebiet(e): 04 Fachbereich Mathematik
04 Fachbereich Mathematik > Optimierung
Hinterlegungsdatum: 03 Apr 2024 05:14
Letzte Änderung: 03 Apr 2024 05:14
PPN:
Zugehörige Links:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen