Reverse propagation of McCormick relaxations
From MaRDI portal
Publication:496587
Recommendations
Cites work
- scientific article; zbMATH DE number 1595639 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 1550909 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A polyhedral branch-and-cut approach to global optimization
- Algorithm 811: NDA
- Algorithm 852
- An Algorithm for Separable Nonconvex Programming Problems
- An analytical approach to global optimization
- An implementation of Shor's \(r\)-algorithm
- Applying interval arithmetic to real, integer, and boolean constraints
- Benchmarking global optimization and constraint satisfaction codes
- 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
- Consistency in networks of relations
- Constraint propagation on quadratic constraints
- Constraint propagation with interval labels
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Convergence rate of McCormick relaxations
- Convex and concave relaxations of implicit functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Coverings of Bipartite Graphs
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Evaluating Derivatives
- Feasibility-based bounds tightening via fixed points
- Generalized McCormick relaxations
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Interval Methods for Systems of Equations
- Interval analysis on directed acyclic graphs for global optimization
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- McCormick-Based Relaxations of Algorithms
- Methods of descent for nondifferentiable optimization
- Newton: Constraint programming over nonlinear constraints
- Numerical constraint satisfaction problems with non-isolated solutions
- Rigorous convex underestimators for general twice-differentiable problems
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Solving Polynomial Systems Using a Branch and Prune Approach
- Solving set-valued constraint satisfaction problems
- The design of the Boost interval arithmetic library
Cited in
(13)- Comparison of MINLP formulations for global superstructure optimization
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility
- Improved convex and concave relaxations of composite bilinear forms
- Tighter McCormick relaxations through subgradient propagation
- (Global) optimization: historical notes and recent developments
- McCormick-Based Relaxations of Algorithms
- Deterministic global optimization with artificial neural networks embedded
- General convex relaxations of implicit functions and inverse functions
- Differentiable McCormick relaxations
- Deterministic global optimization with Gaussian processes embedded
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
- Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations
- EAGO.jl: easy advanced global optimization in Julia
Describes a project that uses
Uses Software
This page was built for publication: Reverse propagation of McCormick relaxations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496587)
