An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

In this paper, a kind of nonlinear optimization problems with nonlinear inequality constraints are discussed, and a new SQP feasible descent algorithm for solving the problems is presented. At each iteration of the new algorithm, a convex quadratic program (QP) which always has feasible solution is...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & mathematics with applications (1987) Jg. 49; H. 2; S. 223 - 238
Hauptverfasser:	Jian, Jin-Bao, Tang, Chun-Ming
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 2005
Schlagworte:	Algorithms Constrained Optimization Constraints Descent Feasible Descent Algorithm Inequalities Mathematical analysis Mathematical models Nonlinear Inequality Nonlinearity Optimization SQP Superlinear Convergence Nonlinear Inequality Feasible Descent Algorithm SQP Superlinear Convergence Constrained Optimization
ISSN:	0898-1221, 1873-7668
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!