Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (Q1652420)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach |
scientific article; zbMATH DE number 6901487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach |
scientific article; zbMATH DE number 6901487 |
Statements
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach (English)
0 references
11 July 2018
0 references
polynomial B-spline
0 references
global optimization
0 references
polynomial optimization
0 references
unconstrained optimization
0 references
0 references
0 references
0 references
0 references
0.9158897
0 references
0.9041865
0 references
0 references
0.87683696
0 references
0.8749938
0 references
0.87482023
0 references
0.8734857
0 references
0.8725368
0 references
