• search hit 4 of 4
Back to Result List

A Decomposition Method for MINLPs with Lipschitz Continuous Nonlinearities

Submission Status:submitted
  • Many mixed-integer optimization problems are constrained by nonlinear functions that do not possess desirable analytical properties like convexity or factorability or cannot even be evaluated exactly. This is, e.g., the case for problems constrained by differential equations or for models that rely on black-box simulation runs. For these problem classes, we present, analyze, and test algorithms that solve mixed-integer problems with only Lipschitz continuous nonlinearities. Our theoretical results depend on the assumptions made on the (in)exactness of function evaluations and on the knowledge of Lipschitz constants. If Lipschitz constants are known, we prove finite termination at approximate globally optimal points both for the case of exact and inexact function evaluations. If only approximate Lipschitz constants are known, we prove finite termination and derive additional conditions under which infeasibility can be detected. A computational study for gas transport problems and an academic case study show the applicability of our algorithms to real-world problems and how different assumptions on the constraint functions up- or downgrade the practical performance of the methods.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Martin Schmidt, Mathias Sirvent, Winnifried Wollner
Document Type:Preprint
Language:English
Date of Publication (online):2017/07/17
Date of first Publication:2017/07/17
Release Date:2017/07/17
Tag:Mixed-Integer Nonlinear Optimization, Lipschitz Optimization, Inexact Function Evaluations, Decomposition Methods, Gas Networks
Pagenumber:28
Institutes:Friedrich-Alexander-Universität Erlangen-Nürnberg
Technische Universität Darmstadt
Subprojects:A05
B08
A08