Extended McCormick relaxation rules for handling empty arguments representing infeasibility

DOI10.1007/s10898-023-01315-7OpenAlexW4384205914MaRDI QIDQ6166098

No author found.

Publication date: 2 August 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-023-01315-7

zbMATH Keywords

McCormick relaxationsglobal dynamic optimizationconstraint-based refinementreduced space optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Improved relaxations for the parametric solutions of ODEs using differential inequalities
• Reverse propagation of McCormick relaxations
• Differentiable McCormick relaxations
• Convergence rate of McCormick relaxations
• Generalized McCormick relaxations
• Deterministic global optimization with artificial neural networks embedded
• Convex and concave relaxations for the parametric solutions of semi-explicit index-one differential-algebraic equations
• Tighter McCormick relaxations through subgradient propagation
• Multivariate McCormick relaxations
• Exploiting nonlinear invariants and path constraints to achieve tighter reachable set enclosures using differential inequalities
• Global optimization of bounded factorable functions with discontinuities
• Nonlinear convex and concave relaxations for the solutions of parametric ODEs
• Convex and concave relaxations of implicit functions
• McCormick-Based Relaxations of Algorithms
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems