Reverse propagation of McCormick relaxations
From MaRDI portal
Publication:496587
DOI10.1007/s10898-015-0303-6zbMath1322.49048OpenAlexW2083297516MaRDI QIDQ496587
Achim Wechsung, Joseph K. Scott, Paul I. Barton, Harry A. J. Watson
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/103127
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 ⋮ Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations ⋮ (Global) optimization: historical notes and recent developments ⋮ Extended McCormick relaxation rules for handling empty arguments representing infeasibility ⋮ Comparison of MINLP formulations for global superstructure optimization ⋮ General convex relaxations of implicit functions and inverse functions ⋮ Improved convex and concave relaxations of composite bilinear forms ⋮ Deterministic global optimization with artificial neural networks embedded ⋮ Differentiable McCormick relaxations ⋮ Tighter McCormick relaxations through subgradient propagation ⋮ Deterministic global optimization with Gaussian processes embedded
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving set-valued constraint satisfaction problems
- Constraint propagation on quadratic constraints
- Convergence rate of McCormick relaxations
- Generalized McCormick relaxations
- Interval analysis on directed acyclic graphs for global optimization
- The design of the Boost interval arithmetic library
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Constraint propagation with interval labels
- An analytical approach to global optimization
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Consistency in networks of relations
- Newton: Constraint programming over nonlinear constraints
- An implementation of Shor's \(r\)-algorithm
- A polyhedral branch-and-cut approach to global optimization
- Rigorous convex underestimators for general twice-differentiable problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Methods of descent for nondifferentiable optimization
- Convex and concave relaxations of implicit functions
- Feasibility-Based Bounds Tightening via Fixed Points
- Coverings of Bipartite Graphs
- Branching and bounds tighteningtechniques for non-convex MINLP
- Evaluating Derivatives
- Algorithm 852
- McCormick-Based Relaxations of Algorithms
- Interval Methods for Systems of Equations
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Solving Polynomial Systems Using a Branch and Prune Approach
- Applying interval arithmetic to real, integer, and boolean constraints
- Complete search in continuous global optimization and constraint satisfaction
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Algorithm 811: NDA
- An Algorithm for Separable Nonconvex Programming Problems
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Global Optimization and Constraint Satisfaction
- Global Optimization and Constraint Satisfaction
This page was built for publication: Reverse propagation of McCormick relaxations
