Solving L 1-CTA in 3D tables by an interior-point method for primal block-angular problems
-
Jordi Castro [1]
;
Jordi Cuesta
[2]
-
[1] Universitat Politècnica de Catalunya
Universitat Politècnica de Catalunya
Barcelona, España
-
[2] Universitat Rovira i Virgili
Universitat Rovira i Virgili
Tarragona, España
-
- Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 21, Nº. 1, 2013, págs. 25-47
- Idioma: inglés
- Enlaces
-
Resumen
The purpose of the field of statistical disclosure control is to avoid that confidential information could be derived from statistical data released by, mainly, national statistical agencies. Controlled tabular adjustment (CTA) is an emerging technique for the protection of statistical tabular data. Given a table with sensitive information, CTA looks for the closest safe table. In this work we focus on CTA for three-dimensional tables using the L 1 norm for the distance between the original and protected tables. Three L 1-CTA models are presented, giving rise to six different primal block-angular structures of the constraint matrices. The resulting linear programming problems are solved by a specialized interior-point algorithm for this constraints structure which solves the normal equations by a combination of Cholesky factorization and preconditioned conjugate gradients (PCG). In the past this algorithm was shown to be one of the most efficient approaches for some classes of block-angular problems. The effect of quadratic regularizations is also analyzed, showing that for three of the six primal block-angular structures the performance of PCG is guaranteed to improve. Computational results are reported for a set of large instances, which provide linear optimization problems of up to 50 million variables and 25 million constraints. The specialized interior-point algorithm is compared with the state-of-the-art barrier solver of the CPLEX 12.1 package, showing to be a more efficient choice for very large L 1-CTA instances.
