Convergence rate of McCormick relaxations
From MaRDI portal
Publication:656830
DOI10.1007/s10898-011-9685-2zbMath1257.90077OpenAlexW1984537576MaRDI QIDQ656830
Alexander Mitsos, Agustín Bompadre
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-9685-2
Related Items
EAGO.jl: easy advanced global optimization in Julia ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ Convergence analysis of Taylor models and McCormick-Taylor models ⋮ Improved relaxations for the parametric solutions of ODEs using differential inequalities ⋮ Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains ⋮ Optimal deterministic algorithm generation ⋮ Chebyshev model arithmetic for factorable functions ⋮ The cluster problem in constrained global optimization ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Optimization methodology assessment for the inlet velocity profile of a hydraulic turbine draft tube. II: Performance evaluation of draft tube model ⋮ A new technique to derive tight convex underestimators (sometimes envelopes) ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ General convex relaxations of implicit functions and inverse functions ⋮ Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization ⋮ Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Global optimization in Hilbert space ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development ⋮ Whitney differentiability of optimal-value functions for bound-constrained convex programming problems ⋮ Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs ⋮ Reverse propagation of McCormick relaxations ⋮ Differentiable McCormick relaxations ⋮ Multivariate McCormick relaxations ⋮ Convergence analysis of multivariate McCormick relaxations ⋮ On tightness and anchoring of McCormick and other relaxations ⋮ The cluster problem revisited ⋮ Global dynamic optimization with Hammerstein-Wiener models embedded ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations ⋮ Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Global minimum potential energy conformations of small molecules
- The cluster problem in multivariate global optimization
- Interval analysis: Theory and applications
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Interval methods for semi-infinite programs
- A polyhedral branch-and-cut approach to global optimization
- Global solution of semi-infinite programs
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Construction of convex relaxations using automated code generation techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Finding all solutions of nonlinearly constrained systems of equations
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Global optimization for molecular conformation problems
- On the Liu-Floudas convexification of smooth programs
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Branching and bounds tighteningtechniques for non-convex MINLP
- McCormick-Based Relaxations of Algorithms
- Relaxation-Based Bounds for Semi-Infinite Programs
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Complete search in continuous global optimization and constraint satisfaction
- On Descent from Local Minima
- Analysis of bounds for multilinear functions
This page was built for publication: Convergence rate of McCormick relaxations
