A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202)
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 globally convergent interior point algorithm for non-convex nonlinear programming |
scientific article; zbMATH DE number 5518725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A globally convergent interior point algorithm for non-convex nonlinear programming |
scientific article; zbMATH DE number 5518725 |
Statements
A globally convergent interior point algorithm for non-convex nonlinear programming (English)
0 references
25 February 2009
0 references
non-convex programming
0 references
combined interior homotopy
0 references
path following algorithm
0 references
global convergence
0 references
0 references
0 references
0.97849137
0 references
0.9705566
0 references
0.9637983
0 references
0.9532398
0 references
0.94695234
0 references
0.9441739
0 references
0.9420296
0 references
0.9416914
0 references
