A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848)
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 new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity |
scientific article; zbMATH DE number 2137737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity |
scientific article; zbMATH DE number 2137737 |
Statements
A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (English)
0 references
23 February 2005
0 references
Nonlinear inequality
0 references
Constrained optimization
0 references
SQP
0 references
Generalized projection
0 references
Feasible descent algorithm
0 references
Superlinear convergence
0 references
Sequential quadratic programming
0 references
Projection method
0 references
Nonlinear programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9137899875640868
0 references
0.9008885622024536
0 references
0.8781266808509827
0 references
0.8397385478019714
0 references
