| Article ID: | iaor20115115 |
| Volume: | 49 |
| Issue: | 2 |
| Start Page Number: | 359 |
| End Page Number: | 378 |
| Publication Date: | Jun 2011 |
| Journal: | Computational Optimization and Applications |
| Authors: | Mateos Mariano, Rsch Arnd |
| Keywords: | programming: quadratic, control, graphs |
A Neumann boundary control problem for a linear‐quadratic elliptic optimal control problem in a polygonal domain is investigated. The main goal is to show an optimal approximation order for discretized problems after a postprocessing process. It turns out that two saturation processes occur: The regularity of the boundary data of the adjoint is limited if the largest angle of the polygon is at least 2