A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization

This paper discusses a kind of nonlinear inequality constrained optimization problems without any constraint qualification. A new sequential quadratic programming algorithm for such problems is proposed, whose important features are as follows: (i) a new relaxation technique for the linearized const...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization Jg. 71; H. 6; S. 1603 - 1635
Hauptverfasser:	Jian, Jinbao, Tang, Chunming, Hu, Qingjie, Han, Daolan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Taylor & Francis 03.06.2022 Taylor & Francis LLC
Schlagworte:	Algorithms Constraints finite convergence Inequality constraints line search nonlinear programming Optimization Penalty function Quadratic programming sequential quadratic programming
ISSN:	0233-1934, 1029-4945
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!