Comparison of MINLP formulations for global superstructure optimization

DOI10.1007/S11081-021-09707-YMaRDI QIDQ6173771zbMATH OpenOpenAlexFDO

Authors Jannik Burre, Dominik Bongartz, Alexander Mitsos

Publication date 13 July 2023

Published in Optimization and Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11081-021-09707-y

zbMATH Keywords

big-Mconvex hullglobal optimizationMcCormickMINLPsuperstructure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1302169
• scientific article; zbMATH DE number 1163727
• Design and operation issues using NLP superstructure modeling
• Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
• scientific article; zbMATH DE number 1054668

Cites work

• A class of smoothing functions for nonlinear and mixed complementarity problems
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
• A reduced space branch and bound algorithm for global optimization.
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• Convergence-order analysis of branch-and-bound algorithms for constrained problems
• Convex and concave relaxations of implicit functions
• Convex programming for disjunctive convex optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
• Deterministic global optimization with artificial neural networks embedded
• Deterministic global optimization with Gaussian processes embedded
• Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
• Generalized convex disjunctive programming: Nonlinear convex hull relaxation
• Generalized McCormick relaxations
• Global minimization by reducing the duality gap
• Global optimization of bounded factorable functions with discontinuities
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Linearization of McCormick relaxations and hybridization with the auxiliary variable method
• Mathematical Programs with Equilibrium Constraints
• McCormick-Based Relaxations of Algorithms
• Multivariate McCormick relaxations
• Reverse propagation of McCormick relaxations
• Review of nonlinear mixed-integer and disjunctive programming techniques
• SCIP: solving constraint integer programs

Cited in

(2)

• A Recursively Recurrent Neural Network (R2N2) Architecture for Learning Iterative Algorithms
• Network flow problem heuristic reduction using machine learning

This page was built for publication: Comparison of MINLP formulations for global superstructure optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173771)