Accurate computation of compaction filters with high regularity

Regularity constraints may be added in the design of compaction filters in two ways, named by us explicit and implicit. Most of the previous work used the explicit approach. We show that the implicit form is much more appropriate in terms of numerical accuracy. We also integrate the implicit approach in the semidefinite programming (SDP) framework, guaranteeing thus global optimality.