Inclusion conditions for the Constrained Polynomial Zonotopic case

摘要

Set operations are well understood for convex sets but become considerably more challenging in the non-convex case due to the loss of structural properties in their representation. Constrained polynomial zonotopes (CPZs) offer an effective compromise, as they can capture complex, typically non-convex geometries while maintaining an algebraic structure suitable for further manipulation. Building on this, we propose novel nonlinear encodings that provide sufficient conditions for testing inclusion between two CPZs and adapt them for seamless integration within optimization frameworks.