Multivariate McCormick relaxations
From MaRDI portal
Publication:2250101
Recommendations
- A new framework to relax composite functions in nonlinear programs
- Convergence rate of McCormick relaxations
- Erratum to: ``Multivariate McCormick relaxations
- Differentiable McCormick relaxations
- Improved convex and concave relaxations of composite bilinear forms
- scientific article; zbMATH DE number 1817778
- McCormick-Based Relaxations of Algorithms
- Tighter McCormick relaxations through subgradient propagation
- Generalized McCormick relaxations
- Convex envelopes of products of convex and component-wise concave functions
Cites work
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A branch-and-reduce approach to global optimization
- A convex envelope formula for multilinear functions
- A framework for globally optimizing mixed-integer signomial programs
- A global optimization algorithm for linear fractional and bilinear programs
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A polyhedral branch-and-cut approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- BARON: A general purpose global optimization software package
- Bounding the Solutions of Parameter Dependent Nonlinear Ordinary Differential Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convergence rate of McCormick relaxations
- Convex envelopes for edge-concave functions
- Convex envelopes of monomials of odd degree
- Convex envelopes of products of convex and component-wise concave functions
- Convex extensions and envelopes of lower semi-continuous functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Existence and sum decomposition of vertex polyhedral convex envelopes
- Finding all solutions of nonlinearly constrained systems of equations
- Form factor for a family of quantum graphs: an expansion to third order
- Generalized Benders decomposition
- Generalized McCormick relaxations
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization of nonconvex problems with multilinear intermediates
- Global solution of optimization problems with parameter-embedded linear dynamic systems.
- GLOMIQO: global mixed-integer quadratic optimizer
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3898606 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3084669 (Why is no real title available?)
- Introduction to global optimization.
- Jointly Constrained Biconvex Programming
- McCormick-Based Relaxations of Algorithms
- Nested Decomposition of Multistage Convex Programs
- On convex relaxations of quadrilinear terms
- On the Composition of Convex Envelopes for Quadrilinear Terms
- Rigorous convex underestimators for general twice-differentiable problems
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
Cited in
(48)- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- 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
- Deterministic global optimization with artificial neural networks embedded
- Some results on the strength of relaxations of multilinear functions
- Tighter McCormick relaxations through subgradient propagation
- Linearization of McCormick relaxations and hybridization with the auxiliary variable method
- Deterministic global optimization with Gaussian processes embedded
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- A new framework to relax composite functions in nonlinear programs
- A conic relaxation model for searching for the global optimum of network data envelopment analysis
- On tightness and anchoring of McCormick and other relaxations
- Erratum to: ``Multivariate McCormick relaxations
- Relaxations of factorable functions with convex-transformable intermediates
- Improved convex and concave relaxations of composite bilinear forms
- Adjoint mode computation of subgradients for McCormick relaxations
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Nonsmooth DAEs with applications in modeling phase changes
- McCormick-Based Relaxations of Algorithms
- Whitney differentiability of optimal-value functions for bound-constrained convex programming problems
- Computationally relevant generalized derivatives: theory, evaluation and applications
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Reverse propagation of McCormick relaxations
- EAGO.jl: easy advanced global optimization in Julia
- Tractable relaxations of composite functions
- Differentiable McCormick relaxations
- Convergence analysis of multivariate McCormick relaxations
- Towards global parameter estimation exploiting reduced data sets
- \(\Gamma\)-robust optimization of project scheduling problems
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- Comparison of MINLP formulations for global superstructure optimization
- General convex relaxations of implicit functions and inverse functions
- Constructing a subgradient from directional derivatives for functions of two variables
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- A branch-and-bound algorithm with growing datasets for large-scale parameter estimation
- Globally optimal scheduling of an electrochemical process via data-driven dynamic modeling and wavelet-based adaptive grid refinement
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- Constructing tight quadratic relaxations for global optimization. II: underestimating difference-of-convex (D.C.) functions
- MUSE-BB: a decomposition algorithm for nonconvex two-stage problems using strong multisection branching
- 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
- New inequalities for comparing ordinary differential equations arising in global dynamic optimization
This page was built for publication: Multivariate McCormick relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250101)
