Pages that link to "Item:Q1863897"
From MaRDI portal
The following pages link to Construction of convex relaxations using automated code generation techniques (Q1863897):
Displaying 12 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- Convergence rate of McCormick relaxations (Q656830) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Guided dive for the spatial branch-and-bound (Q1675571) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- On tightness and anchoring of McCormick and other relaxations (Q2274852) (← links)
- Natural gas production network infrastructure development under uncertainty (Q2358131) (← links)
