Pages that link to "Item:Q1652420"
From MaRDI portal
The following pages link to Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420):
Displaying 3 items.
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
- An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator (Q2114513) (← links)