A restoration-free filter SQP algorithm for equality constrained optimization

In this paper, a trust-region sequential quadratic programming algorithm with a modified filter acceptance mechanism is proposed for nonlinear equality constrained optimization. The most important advantage of the proposed algorithm is its avoidance of any feasibility restoration phase, a necessity...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 219; číslo 11; s. 6016 - 6029
Hlavní autoři: Zhu, Xiaojing, Pu, Dingguo
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.02.2013
Témata:
Algorithms
Constrained optimization
Constraints
Convergence
Feasibility
Feasibility restoration
Filter
Mathematical models
Optimization
Quadratic programming
Sequential quadratic programming
Feasibility restoration
Sequential quadratic programming
Filter
Constrained optimization
ISSN:0096-3003, 1873-5649
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í:In this paper, a trust-region sequential quadratic programming algorithm with a modified filter acceptance mechanism is proposed for nonlinear equality constrained optimization. The most important advantage of the proposed algorithm is its avoidance of any feasibility restoration phase, a necessity in traditional filter methods. We solve quadratic programming subproblems based on the well-known Byrd–Omojokun trust-region method. Inexact solutions to these subproblems are allowed. Under some standard assumptions, global convergence of the proposed algorithm is established. Numerical results show our approach is potentially useful.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2012.12.002