An inexact [ell] sub(1) penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity

We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential quadratic programming with a line search that uses the [ell] sub(1) penalty function for an Armijo-like condition. Both the objective gradient comp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization methods & software Jg. 28; H. 5; S. 943 - 968
Hauptverfasser:	Hess, Wolfgang, Ulbrich, Stefan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	01.10.2013
Schlagworte:	Algorithms Iterative methods Mathematical analysis Mathematical models Optimization Partial differential equations Searching Shape optimization Solvers
ISSN:	1055-6788, 1029-4937
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!