Construction of convex relaxations using automated code generation techniques

DOI10.1023/A:1021095211251MaRDI QIDQ1863897zbMATH OpenOpenAlexFDO

Authors Edward P. Gatzke, John E. Tolsma, 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

zbMATH Keywords

automatic code generationconvex relaxationDAEPACKglobal optimization

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Nonconvex programming, global optimization (90C26)

Recommendations

• Generalized McCormick relaxations
• Differentiable McCormick relaxations
• McCormick-Based Relaxations of Algorithms
• Validated Linear Relaxations and Preprocessing: Some Experiments
• A polyhedral branch-and-cut approach to global optimization

Cited in

(13)

• Guided dive for the spatial branch-and-bound
• A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
• A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• On tightness and anchoring of McCormick and other relaxations
• 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
• A framework for globally optimizing mixed-integer signomial programs
• CVXGEN: a code generator for embedded convex optimization
• Validated Linear Relaxations and Preprocessing: Some Experiments
• Convergence rate of McCormick relaxations
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs

Describes a project that uses

Uses Software

• DAEPACK

This page was built for publication: Construction of convex relaxations using automated code generation techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863897)