A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812)
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 superlinearly and quadratically convergent SQP type feasible method for constrained optimization |
scientific article; zbMATH DE number 1542574
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A superlinearly and quadratically convergent SQP type feasible method for constrained optimization |
scientific article; zbMATH DE number 1542574 |
Statements
A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (English)
0 references
16 July 2002
0 references
constrained optimization
0 references
SQP
0 references
feasible method
0 references
convergence
0 references
rate of convergence
0 references
0 references
