A homotopy method for getting a local minimum of constrained nonconvex programming (Q838080)
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: A homotopy method for getting a local minimum of constrained nonconvex programming |
scientific article; zbMATH DE number 5597869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A homotopy method for getting a local minimum of constrained nonconvex programming |
scientific article; zbMATH DE number 5597869 |
Statements
A homotopy method for getting a local minimum of constrained nonconvex programming (English)
0 references
21 August 2009
0 references
K-K-T point
0 references
local minimum
0 references
homotopy method
0 references
interior point method
0 references
0 references
0.9495053887367249
0 references
0.9113786816596984
0 references
0.9010196328163148
0 references
0.8647919297218323
0 references
0.8614497780799866
0 references
