McCormick-Based Relaxations of Algorithms
From MaRDI portal
Recommendations
- Generalized McCormick relaxations
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Differentiable McCormick relaxations
- Multivariate McCormick relaxations
- Efficient MIP techniques for computing the relaxation complexity
- Convergence rate of McCormick relaxations
- Reverse propagation of McCormick relaxations
- Matrix relaxations in combinatorial optimization
- A relaxation algorithm for solving mixed integer programming problems
- Discrete relaxations of combinatorial programs
Cited in
(80)- Global optimization of bounded factorable functions with discontinuities
- A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem
- Out-of-sample estimation for a branch-and-bound algorithm with growing datasets
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Reachability analysis and deterministic global optimization of DAE models
- On the strength of recursive McCormick relaxations for binary polynomial optimization
- Implicit parametrizations and applications in optimization and control
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Decision-dependent probabilities in stochastic programs with recourse
- Efficient polyhedral enclosures for the reachable set of nonlinear control systems
- Optimal deterministic algorithm generation
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- Multimodal transportation flows in energy networks with an application to crude oil markets
- Tighter McCormick relaxations through subgradient propagation
- Stable set-valued integration of nonlinear dynamic systems using affine set-parameterizations
- Global optimization of semi-infinite programs via restriction of the right-hand side
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Comparison of MINLP formulations for global superstructure optimization
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- Numerical simulation of differential-algebraic equations with embedded global optimization criteria
- 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
- Convex and concave relaxations of implicit functions
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
- Deterministic global optimization with Gaussian processes embedded
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- New inequalities for comparing ordinary differential equations arising in global dynamic optimization
- A separation based optimization approach to dynamic maximal covering location problems with switched structure
- A conic relaxation model for searching for the global optimum of network data envelopment analysis
- Improved convex and concave relaxations of composite bilinear forms
- Obey validity limits of data-driven models through topological data analysis and one-class classification
- A reliable affine relaxation method for global optimization
- Towards global parameter estimation exploiting reduced data sets
- 50 years of mixed-integer nonlinear and disjunctive programming
- libMC
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- EAGO.jl: easy advanced global optimization in Julia
- Automatic source code generation for deterministic global optimization with parallel architectures
- A framework for globally optimizing mixed-integer signomial programs
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- A kinematic smoothing method for tightening convex relaxations of ordinary differential equations
- Optimal fixed-levels control for nonlinear systems with quadratic cost-functionals
- Chebyshev model arithmetic for factorable functions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Globally optimal scheduling of an electrochemical process via data-driven dynamic modeling and wavelet-based adaptive grid refinement
- General convex relaxations of implicit functions and inverse functions
- Working fluid selection for organic rankine cycles via deterministic global optimization of design and operation
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Nonsmooth exclusion test for finding all solutions of nonlinear equations
- Subdomain separability in global optimization
- 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
- A first-order numerical approach to switched-mode systems optimization
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Convex and concave envelopes of artificial neural network activation functions for deterministic global optimization
- Reduced outer space algorithm for globally computing affine sum-of-ratios problems
- Convergence analysis of Taylor models and McCormick-Taylor models
- How to solve a design centering problem
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Global dynamic optimization with Hammerstein-Wiener models embedded
- 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
- Deterministic global optimization with artificial neural networks embedded
- Adjoint mode computation of subgradients for McCormick relaxations
- The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
- Multivariate McCormick relaxations
- Differentiable McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
- Global optimization in Hilbert space
This page was built for publication: McCormick-Based Relaxations of Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563896)
