Abstract
We consider an elliptic distributed optimal control problem with state constraints and compare three post-processing procedures that compute approximations of the optimal control from the approximation of the optimal state obtained by a quadratic C0 interior penalty method.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
