A feasible trust-region algorithm for inequality constrained optimization

The paper presents an algorithm for smooth nonlinearly inequality constrained optimization problems, in which a sequence of feasible iterates is generated by a trust-region sequential quadratic programming subproblem at each iteration. Because of retaining feasibility, the objective function can be...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and computation Jg. 173; H. 1; S. 513 - 522
Hauptverfasser: Peng, Ye-hui, Yao, Shengbao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY Elsevier Inc 01.02.2006
Elsevier
Schlagworte:
Calculus of variations and optimal control
Exact sciences and technology
Feasible trust-region algorithm
Globally convergent
Inequality constrained optimization
KKT point
Mathematical analysis
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Numerical methods in optimization and calculus of variations
Sciences and techniques of general use
SQP
Feasible trust-region algorithm
Globally convergent
SQP
KKT point
Inequality constrained optimization
Feasible trust region algorithm
Optimization method
Quadratic programming
Constrained optimization
Numerical analysis
Applied mathematics
Sequential method
Feasibility
Objective function
ISSN:0096-3003, 1873-5649
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The paper presents an algorithm for smooth nonlinearly inequality constrained optimization problems, in which a sequence of feasible iterates is generated by a trust-region sequential quadratic programming subproblem at each iteration. Because of retaining feasibility, the objective function can be used as a merit function and the subproblems are feasible. Under common assumptions, the algorithm is globally convergent. The numerical results show it is promising.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2005.04.080