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

Uloženo v:
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!
Popis
Shrnutí: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 constraints of the quadratic programming subproblem is introduced, which guarantees that the subproblem is always consistent and generates a favourable search direction; (ii) a weaker positive-definiteness assumption on the quadratic coefficient matrices is presented; (iii) a slightly new line search is adopted, where neither a penalty function nor a filter is used; (iv) an associated acceptable termination rule is introduced; (v) the finite convergence of the algorithm is proved. Furthermore, the numerical results on a collection of CUTE test problems show that the proposed algorithm is promising.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2020.1827406