Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
type: Item
instance of: scholarly article
title: Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
zbMATH Open document ID: 1473.90093
author: F. Liers
author: Alexander Martin
author: Maximilian Merkert
author: Nick Mertens
author: Dennis Michaels
published in: Journal of Global Optimization
publication date: 2021-08-11T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7380934
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: simultaneous convexification
zbMATH Keywords: convex envelope
zbMATH Keywords: gas network optimization
describes a project that uses: MINLP
describes a project that uses: SCIP
describes a project that uses: ANTIGONE
describes a project that uses: GasLib
MaRDI profile type: Publication
full work available at URL: s10898-020-00974-0
OpenAlex ID: W3006134215
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: Convex relaxations for mixed-integer nonlinear programs
cites work: Mixed-integer nonlinear optimization
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
cites work: The Convex Envelope of (n–1)-Convex Functions
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Convex envelopes generated from finitely many compact convex sets
cites work: Evaluating Gas Network Capacities
cites work: Global optimization with polynomials and the problem of moments
cites work: Convex envelopes of monomials of odd degree
cites work: Global optimization. Theory, algorithms, and applications
cites work: On convex envelopes for bivariate functions over polytopes
cites work: Mixed integer models for the stationary case of gas network optimization
cites work: Convex envelopes for edge-concave functions
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: A convex envelope formula for multilinear functions
cites work: A new reformulation-linearization technique for bilinear programming problems
cites work: Semidefinite relaxations of fractional programs via novel convexification techniques
cites work: Convex extensions and envelopes of lower semi-continuous functions
cites work: A polyhedral branch-and-cut approach to global optimization
DOI: 10.1007/S10898-020-00974-0
description: scientific article; zbMATH DE number 7380934