Homotopy method for getting a local minimum of unconstrained non-convex programming (Q3089846)
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: Homotopy method for getting a local minimum of unconstrained non-convex programming |
scientific article; zbMATH DE number 5943338
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Homotopy method for getting a local minimum of unconstrained non-convex programming |
scientific article; zbMATH DE number 5943338 |
Statements
25 August 2011
0 references
unconstrained nonconvex programming
0 references
homotopy method
0 references
local minimum
0 references
0.925104320049286
0 references
0.9113786816596984
0 references
0.8680180311203003
0 references
0.8435108065605164
0 references
