An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397)
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: An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity |
scientific article; zbMATH DE number 2191926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity |
scientific article; zbMATH DE number 2191926 |
Statements
An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (English)
0 references
4 August 2005
0 references
Nonlinear Inequality
0 references
Constrained Optimization
0 references
SQP
0 references
Feasible Descent Algorithm
0 references
Superlinear Convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9189751744270324
0 references
0.9137899875640868
0 references
0.8959748148918152
0 references
0.8807049989700317
0 references
