A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization. (Q2746550)
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 algorithm for inequality constrained optimization. |
scientific article; zbMATH DE number 1656203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization. |
scientific article; zbMATH DE number 1656203 |
Statements
2001
0 references
A superlinearly and quadratically convergent SQP algorithm for inequality constrained optimization. (English)
0 references
0.9091288447380066
0 references
0.902450680732727
0 references
0.8910825252532959
0 references
0.8878161311149597
0 references
0.8867634534835815
0 references
