Abstract
We investigate numerical methods to approximate the projection-operator from H1 0 into the set of convex functions. We introduce a new formulation of the problem, based on gradient fi elds. It leads in a natural way to an in finite-dimensional saddle-point problem, which can be shown to be ill-posed in general. Existence and uniqueness of a saddle point is obtained for a Lagrangian de ned in suitable spaces. This well-posed formulation does not lead to an implementable algorithm. Yet, numerical experiments based on a discretization of the fi rst formulation exhibit a good behaviour.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
