Linearization of McCormick relaxations and hybridization with the auxiliary variable method
type: Item
instance of: scholarly article
title: Linearization of McCormick relaxations and hybridization with the auxiliary variable method
zbMATH Open document ID: 1475.90070
author: Jaromił Najman
author: Dominik Bongartz
author: Alexander Mitsos
published in: Journal of Global Optimization
publication date: 2021-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7382679
zbMATH Keywords: global optimization
zbMATH Keywords: McCormick
zbMATH Keywords: linearization
zbMATH Keywords: MAiNGO
describes a project that uses: libMC
describes a project that uses: NLopt
describes a project that uses: Ipopt
describes a project that uses: sobol.cc
describes a project that uses: SCIP
describes a project that uses: CPLEX
describes a project that uses: ANTIGONE
describes a project that uses: MAiNGO
MaRDI profile type: Publication
full work available at URL: s10898-020-00977-x
OpenAlex ID: W3128110744
cites work: Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
cites work: Q4821526
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: On the optimal Halton sequence
cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Three enhancements for optimization-based bound tightening
cites work: On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
cites work: A Note on Performance Profiles for Benchmarking Software
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: Q4273942
cites work: Q3997222
cites work: Constructing Sobol Sequences with Better Two-Dimensional Projections
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A hybrid LP/NLP paradigm for global optimization relaxations
cites work: Differentiable McCormick relaxations
cites work: Global optimization. Theory, algorithms, and applications
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: McCormick-Based Relaxations of Algorithms
cites work: Tighter McCormick relaxations through subgradient propagation
cites work: Location of the Maximum on Unimodal Surfaces
cites work: Interval analysis on directed acyclic graphs for global optimization
cites work: Q4204004
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: Multivariate McCormick relaxations
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
DOI: 10.1007/S10898-020-00977-X
Recommended article: Multivariate McCormick relaxations
Recommended article: Q3402851
Recommended article: Generalized McCormick relaxations
Recommended article: Convergence analysis of multivariate McCormick relaxations
Recommended article: Differentiable McCormick relaxations
Recommended article: Relaxation Methods for Linear Programs
Recommended article: Q4248780
Recommended article: A hybrid method fur linearly constrained optimisation problems
Recommended article: A linearization method for generalized complementarity problems
Recommended article: A hybrid method for linear programming
description: scientific article; zbMATH DE number 7382679