Tighter McCormick relaxations through subgradient propagation
From MaRDI portal
Publication:2010084
DOI10.1007/s10898-019-00791-0zbMath1429.49033arXiv1710.09188OpenAlexW2962939142MaRDI QIDQ2010084
Alexander Mitsos, Jaromił Najman
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.09188
global optimizationrange reductionMAiNGOconcave relaxationsMcCormick subgradient propagationMcCormick technique
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37) Numerical methods of relaxation type (49M20)
Related Items
EAGO.jl: easy advanced global optimization in Julia ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Linearization of McCormick relaxations and hybridization with the auxiliary variable method ⋮ Global dynamic optimization with Hammerstein-Wiener models embedded ⋮ Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of Taylor models and McCormick-Taylor models
- A reliable affine relaxation method for global optimization
- Reverse propagation of McCormick relaxations
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- Three enhancements for optimization-based bound tightening
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Generalized McCormick relaxations
- The cluster problem revisited
- Computing the range of values of real functions with accuracy higher than second order
- Interval analysis on directed acyclic graphs for global optimization
- An analytical approach to global optimization
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- The cluster problem in multivariate global optimization
- A finite algorithm for global minimization of separable concave programs
- Convergence-order analysis of branch-and-bound algorithms for constrained problems
- The cluster problem in constrained global optimization
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Domain reduction techniques for global NLP and MINLP optimization
- Deterministic global optimization with artificial neural networks embedded
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- A branch-and-reduce approach to global optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Multivariate McCormick relaxations
- On tightness and anchoring of McCormick and other relaxations
- Affine arithmetic: concepts and applications
- Erratum to: ``Multivariate McCormick relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- McCormick-Based Relaxations of Algorithms
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- A Note on Performance Profiles for Benchmarking Software
This page was built for publication: Tighter McCormick relaxations through subgradient propagation
