Linearization of McCormick relaxations and hybridization with the auxiliary variable method

DOI10.1007/S10898-020-00977-XzbMath1475.90070OpenAlexW3128110744MaRDI QIDQ2046304

Jaromił Najman, Alexander Mitsos, Dominik Bongartz

Publication date: 17 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00977-x

zbMATH Keywords

global optimizationlinearizationMcCormickMAiNGO

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (2)

Comparison of MINLP formulations for global superstructure optimization ⋮ Identification of mechanical properties of arteries with certification of global optimality

Uses Software

• Unnamed Item
• CPLEX
• Ipopt
• libMC
• ANTIGONE
• NLopt
• MAiNGO
• sobol.cc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructing Sobol Sequences with Better Two-Dimensional Projections
• Differentiable McCormick relaxations
• Three enhancements for optimization-based bound tightening
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• Interval analysis on directed acyclic graphs for global optimization
• Newton's method for convex programming and Tschebyscheff approximation
• A hybrid LP/NLP paradigm for global optimization relaxations
• Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
• A polyhedral branch-and-cut approach to global optimization
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Tighter McCormick relaxations through subgradient propagation
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Multivariate McCormick relaxations
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the optimal Halton sequence
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• The Cutting-Plane Method for Solving Convex Programs
• McCormick-Based Relaxations of Algorithms
• A central cutting plane algorithm for the convex programming problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• A Note on Performance Profiles for Benchmarking Software
• Location of the Maximum on Unimodal Surfaces
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: Linearization of McCormick relaxations and hybridization with the auxiliary variable method