A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11766-000-0057-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2320608532 / rank | |||
Normal rank | |||
Revision as of 01:54, 20 March 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
