Globally convergent interior-point algorithm for nonlinear programming (Q2569192)
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: Globally convergent interior-point algorithm for nonlinear programming |
scientific article; zbMATH DE number 2215038
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globally convergent interior-point algorithm for nonlinear programming |
scientific article; zbMATH DE number 2215038 |
Statements
Globally convergent interior-point algorithm for nonlinear programming (English)
0 references
18 October 2005
0 references
Primal-dual interior-point algorithms
0 references
merit functions
0 references
convergence theory
0 references
0 references
0 references
0 references
0 references
0.860938310623169
0 references
0.8591075539588928
0 references
0.8585367798805237
0 references
0.8553692698478699
0 references
