A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11766-000-0057-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11766-000-0057-9 / rank | |||
Normal rank | |||
Latest revision as of 21:59, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A superlinearly and quadratically convergent SQP type feasible method for constrained optimization |
scientific article |
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
