A Second Order Cone Formulation of Continuous CTA Model

<p> In this paper we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of the CTA model is to find the closest safe table to some original tabular data set that contains sensitive information. The measure of closeness is usually measured using &ell;1&ell;1 or &ell;2&ell;2 norm; with each measure having its advantages and disadvantages. Recently, in [4] a regularization of the &ell;1&ell;1-CTA using Pseudo-Huber function was introduced in an attempt to combine positive characteristics of both &ell;1&ell;1-CTA and &ell;2&ell;2-CTA. All three models can be solved using appropriate versions of Interior-Point Methods (IPM). It is known that IPM in general works better on well structured problems such as conic optimization problems, thus, reformulation of these CTA models as conic optimization problem may be advantageous. We present reformulation of Pseudo-Huber-CTA, and &ell;1&ell;1-CTA as Second-Order Cone (SOC) optimization problems and test the validity of the approach on the small example of two-dimensional tabular data set.</p>