DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/14438

Arxiu Descripció MidaFormat
dr2011-01.pdf185,4 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Castro, J.; Cuesta, J. "Solving $L_1$-CTA in 3D tables by an interior-point method for primal block-angular problems". 2011.
Títol: Solving $L_1$-CTA in 3D tables by an interior-point method for primal block-angular problems
Autor: Castro Pérez, Jordi Veure Producció científica UPC; Cuesta Andrea, Jordi
Data: mar-2011
Tipus de document: External research report
Citació: DR 2011/01
Resum: The purpose of the field of statistical disclosure control is to avoid that no confidential information can 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 to be protected, CTA looks for the closest safe table. In this work we focus on CTA for three-dimensional tables using the L1 norm for the distance between the original and protected tables. Three L1-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 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 millions of variables and 25 millions of 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 L1-CTA instances.
URI: http://hdl.handle.net/2117/14438
Versió de l'editor: http://www-eio.upc.es/~jcastro/publications/reports/dr2011-01.pdf
Apareix a les col·leccions:Altres. Enviament des de DRAC
GNOM - Grup d´Optimització Numèrica i Modelització. Reports de recerca
Departament d'Estadística i Investigació Operativa. Reports de recerca
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius