A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848): 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.1016/j.amc.2004.01.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990383971 / rank | |||
Normal rank | |||
Revision as of 20:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity |
scientific article |
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
