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...
Uložené v:
| Vydané v: | Optimization methods & software Ročník 28; číslo 5; s. 943 - 968 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
01.10.2013
|
| Predmet: | |
| ISSN: | 1055-6788, 1029-4937 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!