Pages that link to "Item:Q300751"
From MaRDI portal
The following pages link to Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751):
Displaying 6 items.
- A MIQCP formulation for B-spline constraints (Q1653267) (← links)
- Optimization of black-box problems using Smolyak grids and polynomial approximations (Q1668801) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- A subdivision algorithm to reason on high-degree polynomial constraints over finite domains (Q2294575) (← links)
- Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form (Q2363599) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
