Extended McCormick relaxation rules for handling empty arguments representing infeasibility
From MaRDI portal
Recommendations
- An extended semidefinite relaxation for satisfiability
- McCormick-Based Relaxations of Algorithms
- On a relaxation method for mathematical programs with vanishing constraints
- Generalized McCormick relaxations
- Relaxation on Optimization Predicates
- Extension to sufficient optimality conditions in complex programming
- A note on resolving infeasibility in linear programs by constraint relaxation
- Principles and Practice of Constraint Programming – CP 2004
- Exploiting semidefinite relaxations in constraint programming
- Complexity results and algorithms for extension enforcement in abstract argumentation
Cites work
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convergence rate of McCormick relaxations
- Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
- Convex and concave relaxations of implicit functions
- Deterministic global optimization with artificial neural networks embedded
- Differentiable McCormick relaxations
- Exploiting nonlinear invariants and path constraints to achieve tighter reachable set enclosures using differential inequalities
- Generalized McCormick relaxations
- Global optimization of bounded factorable functions with discontinuities
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Improved relaxations for the parametric solutions of ODEs using differential inequalities
- McCormick-Based Relaxations of Algorithms
- Multivariate McCormick relaxations
- Nonlinear convex and concave relaxations for the solutions of parametric ODEs
- Reverse propagation of McCormick relaxations
- Tighter McCormick relaxations through subgradient propagation
Cited in
(4)- Modification and improved implementation of the RPD method for computing state relaxations for global dynamic optimization
- A kinematic smoothing method for tightening convex relaxations of ordinary differential equations
- Tightening state relaxations for global dynamic optimization using dynamic cuts
- Automatic source code generation for deterministic global optimization with parallel architectures
This page was built for publication: Extended McCormick relaxation rules for handling empty arguments representing infeasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166098)
