Optimal $L^p$-approximation of convex sets by convex subsets
Zakaria Fattah, Ilias Ftouhi, Enrique Zuazua

TL;DR
This paper studies the optimal convex subset approximation of a convex set in b^n using a shape optimization approach based on the p-distance functional, proving existence, convergence, and providing computational methods especially in 2D.
Contribution
It introduces a new shape optimization framework for convex set approximation, proves existence of solutions, analyzes bc-convergence, and develops an efficient computational method in 2D.
Findings
Existence of optimal convex subsets minimizing the p-distance functional.
bc-convergence of the minimization problem to Hausdorff distance minimization as p b7 f7.
In 2D, optimal shapes have polygonal free boundary parts, and the new computational method accurately captures boundary segments.
Abstract
Given a convex set of , we consider the shape optimization problem of finding a convex subset , of a given measure, minimizing the -distance functional where and and are the support functions of and the fixed container , respectively. We prove the existence of solutions and show that this minimization problem -converges, when tends to , towards the problem of finding a convex subset , of a given measure, minimizing the Hausdorff distance to the convex . In the planar case, we show that the free parts of the boundary of the optimal shapes, i.e., those that are in the interior of , are given by polygonal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsApproximation Theory and Sequence Spaces · Optimization and Variational Analysis · Mathematical Approximation and Integration
