Generalized McCormick relaxations
From MaRDI portal
Publication:656963
DOI10.1007/S10898-011-9664-7zbMATH Open1232.49033OpenAlexW1982200089MaRDI QIDQ656963FDOQ656963
Joseph K. Scott, Paul I. Barton, Matthew D. Stuber
Publication date: 13 January 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9664-7
Recommendations
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- McCormick-Based Relaxations of Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Methods for Systems of Equations
- Global optimization with nonlinear ordinary differential equations
- Validated solutions of initial value problems for parametric ODEs
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Title not available (Why is that?)
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convex envelopes of monomials of odd degree
- Deterministic global optimization in nonlinear optimal control problems
- Validated solutions of initial value problems for ordinary differential equations
- A rigorous global optimization algorithm for problems with ordinary differential equations
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Perturbation Bounds for Nonlinear Equations
- Proof of convergence for a global optimization algorithm for problems with ordinary differential equations
Cited In (42)
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Tighter McCormick relaxations through subgradient propagation
- A new technique to derive tight convex underestimators (sometimes envelopes)
- Comparison of MINLP formulations for global superstructure optimization
- McCormick-Based Relaxations of Algorithms
- Reachability Analysis and Deterministic Global Optimization of DAE Models
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- Convex and concave relaxations of implicit functions
- On tightness and anchoring of McCormick and other relaxations
- Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Improved convex and concave relaxations of composite bilinear forms
- EAGO.jl: easy advanced global optimization in Julia
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- The cluster problem revisited
- General convex relaxations of implicit functions and inverse functions
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Construction of convex relaxations using automated code generation techniques
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Reverse propagation of McCormick relaxations
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Interval bounds on the solutions of semi-explicit index-one DAEs. I: Analysis
- Interval bounds on the solutions of semi-explicit index-one DAEs. II: Computation
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- (Global) optimization: historical notes and recent developments
- Deterministic global optimization with artificial neural networks embedded
- Convex envelope of bivariate cubic functions over rectangular regions
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
- Multivariate McCormick relaxations
- Differentiable McCormick relaxations
- Global optimization of bounded factorable functions with discontinuities
- Convergence analysis of multivariate McCormick relaxations
Uses Software
This page was built for publication: Generalized McCormick relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656963)
