Reformulations for utilizing separability when solving convex MINLP problems
type: Item
instance of: scholarly article
title: Reformulations for utilizing separability when solving convex MINLP problems
zbMATH Open document ID: 1402.90098
author: Jan Kronqvist
author: Andreas Lundell
author: Tapio Westerlund
published in: Journal of Global Optimization
publication date: 2018-07-18T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6905234
zbMATH Keywords: convex MINLP
zbMATH Keywords: lifted polyhedral approximation
zbMATH Keywords: separable MINLP
zbMATH Keywords: extended cutting plane algorithm
zbMATH Keywords: extended supporting hyperplane algorithm
zbMATH Keywords: outer approximation
describes a project that uses: Bonmin
describes a project that uses: AlphaECP
describes a project that uses: L1-MAGIC
describes a project that uses: MINLP
describes a project that uses: ve08
describes a project that uses: extended-MIQCP
describes a project that uses: BARON
describes a project that uses: SHOT
MaRDI profile type: Publication
full work available at URL: s10898-018-0616-3
OpenAlex ID: W2793437242
cites work: Projection, lifting and extended formulation integer and combinatorial optimization
cites work: On interval branch-and-bound for additively separable functions with common variables
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: A tutorial on geometric programming
cites work: Q4821526
cites work: BARON: A general purpose global optimization software package
cites work: Extended formulations in combinatorial optimization
cites work: A tree-search algorithm for mixed integer programming problems
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: A review of recent advances in global optimization
cites work: Generalized Benders decomposition
cites work: Q3677522
cites work: The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
cites work: Review of nonlinear mixed-integer and disjunctive programming techniques
cites work: Q4371068
cites work: An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
cites work: Convex underestimation for posynomial functions of positive variables
cites work: Extended Formulations in Mixed-Integer Convex Programming
cites work: A reformulation framework for global optimization
cites work: Convex Analysis
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Extended formulations in mixed integer conic quadratic programming
cites work: Polyhedral approximations inp-order cone programming
cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
DOI: 10.1007/S10898-018-0616-3
description: scientific article; zbMATH DE number 6905234