Proximal Methods for Elliptic Optimal Control Problems with Sparsity Cost Functional
Please always quote using this URN: urn:nbn:de:bvb:20-opus-145850
- First-order proximal methods that solve linear and bilinear elliptic optimal control problems with a sparsity cost functional are discussed. In particular, fast convergence of these methods is proved. For benchmarking purposes, inexact proximal schemes are compared to an inexact semismooth Newton method. Results of numerical experiments are presented to demonstrate the computational effectiveness of proximal schemes applied to infinite-dimensional elliptic optimal control problems and to validate the theoretical estimates.
Author: | Andreas Schindele, Alfio Borzì |
---|---|
URN: | urn:nbn:de:bvb:20-opus-145850 |
Document Type: | Journal article |
Faculties: | Fakultät für Mathematik und Informatik / Institut für Mathematik |
Language: | English |
Parent Title (English): | Applied Mathematics |
Year of Completion: | 2016 |
Volume: | 7 |
Issue: | 9 |
Pagenumber: | 967-992 |
Source: | Applied Mathematics, 2016, 7, 967-992. doi:10.4236/am.2016.79086 |
DOI: | https://doi.org/10.4236/am.2016.79086 |
Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
Tag: | elliptic PDE; nonsmooth optimization; optimal control; proximal method; semismooth Newton method |
Release Date: | 2017/03/29 |
Collections: | Open-Access-Publikationsfonds / Förderzeitraum 2016 |
Licence (German): | CC BY: Creative-Commons-Lizenz: Namensnennung |