Construction of convex relaxations using automated code generation techniques
From MaRDI portal
Publication:1863897
DOI10.1023/A:1021095211251zbMath1035.90063OpenAlexW167974833MaRDI QIDQ1863897
John E. Tolsma, Edward P. Gatzke, Paul I. Barton
Publication date: 12 March 2003
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021095211251
Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (11)
Natural gas production network infrastructure development under uncertainty ⋮ Global optimization with spline constraints: a new branch-and-bound method based on B-splines ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Guided dive for the spatial branch-and-bound ⋮ A framework for globally optimizing mixed-integer signomial programs ⋮ A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms ⋮ Convergence rate of McCormick relaxations ⋮ Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs ⋮ ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ On tightness and anchoring of McCormick and other relaxations
Uses Software
This page was built for publication: Construction of convex relaxations using automated code generation techniques
