Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems
DOI10.1007/s11750-011-0247-zzbMath1269.90149OpenAlexW2162254681MaRDI QIDQ1948525
Publication date: 23 April 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0247-z
interior-point methodscontrolled tabular adjustmentpreconditioned conjugate gradientregularizationslarge-scale computational optimizationprimal block-angular problemsstatistical tabular data protection
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51)
Uses Software
Cites Work
- A heuristic block coordinate descent approach for controlled tabular adjustment
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Privacy in statistical databases. UNESCO chair in data privacy, international conference, PSD 2010, Corfu, Greece, September 22--24, 2010. Proceedings
- Parallel interior-point solver for structured linear programs
- Multiple centrality corrections in a primal-dual method for linear programming
- Quadratic interior-point methods in statistical disclosure control
- Minimum-distance controlled perturbation methods for large-scale tabular data protection
- An interior-point approach for primal block-angular problems
- On the Implementation of a Primal-Dual Interior Point Method
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
This page was built for publication: Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems
