Recommendations
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A polyhedral branch-and-cut approach to global optimization
- Analysis of bounds for multilinear functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Construction of convex relaxations using automated code generation techniques
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Finding all solutions of nonlinearly constrained systems of equations
- Global minimum potential energy conformations of small molecules
- Global optimization for molecular conformation problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global solution of semi-infinite programs
- Interval analysis: Theory and applications
- Interval methods for semi-infinite programs
- Jointly Constrained Biconvex Programming
- McCormick-Based Relaxations of Algorithms
- On Descent from Local Minima
- On the Liu-Floudas convexification of smooth programs
- Relaxation-Based Bounds for Semi-Infinite Programs
- Rigorous convex underestimators for general twice-differentiable problems
- The cluster problem in multivariate global optimization
- The theoretical and empirical rate of convergence for geometric branch-and-bound methods
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Tight convex underestimators for \({{\mathcal C}^2}\)-continuous problems. I: Univariate functions
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(42)- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Piecewise linear bounding functions in univariate global optimization
- Optimal deterministic algorithm generation
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- A new technique to derive tight convex underestimators (sometimes envelopes)
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- On the convergence order of value function relaxations used in decomposition-based global optimization of nonconvex stochastic programs
- McCormick-Based Relaxations of Algorithms
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- On tightness and anchoring of McCormick and other relaxations
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Improved convex and concave relaxations of composite bilinear forms
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- EAGO.jl: easy advanced global optimization in Julia
- A framework for globally optimizing mixed-integer signomial programs
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- The cluster problem in constrained global optimization
- The cluster problem revisited
- Explicit convergence rates for MRAC-type systems
- Chebyshev model arithmetic for factorable functions
- General convex relaxations of implicit functions and inverse functions
- Optimization methodology assessment for the inlet velocity profile of a hydraulic turbine draft tube. II: Performance evaluation of draft tube model
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Reverse propagation of McCormick relaxations
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Convergence analysis of Taylor models and McCormick-Taylor models
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Global dynamic optimization with Hammerstein-Wiener models embedded
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Corrections to: ``Differentiable McCormick relaxations
- Deterministic global optimization with artificial neural networks embedded
- Erratum to: ``Multivariate McCormick relaxations
- Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
- Multivariate McCormick relaxations
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- Differentiable McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
- Global optimization in Hilbert space
This page was built for publication: Convergence rate of McCormick relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656830)
