A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming (Q4521377)
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 primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming |
scientific article; zbMATH DE number 1545487
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming |
scientific article; zbMATH DE number 1545487 |
Statements
A primal–dual interior point algorithm with an exact and differentiable merit function for nonlinear programming (English)
0 references
22 July 2002
0 references
nonlinear programming
0 references
constrained optimization
0 references
primal-dual interior point methods
0 references
global convergence
0 references
0.9221774
0 references
0.92007554
0 references
0.9189019
0 references
0.9178988
0 references
0.9175198
0 references
