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...
Saved in:
| Published in: | Optimization methods & software Vol. 28; no. 5; pp. 943 - 968 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.10.2013
|
| Subjects: | |
| ISSN: | 1055-6788, 1029-4937 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!