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...

Celý popis

Podrobná bibliografie

Vydáno v:	Optimization Ročník 71; číslo 6; s. 1603 - 1635
Hlavní autoři:	Jian, Jinbao, Tang, Chunming, Hu, Qingjie, Han, Daolan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia Taylor & Francis 03.06.2022 Taylor & Francis LLC
Témata:	Algorithms Constraints finite convergence Inequality constraints line search nonlinear programming Optimization Penalty function Quadratic programming sequential quadratic programming
ISSN:	0233-1934, 1029-4945
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!