Randomized Rounding for the Largest Simplex Problem

The maximum volume j-simplex problem asks to compute the j-dimensional simplex of maximum volume inside the convex hull of a given set of n points in Qd. We give a deterministic approximation algorithm for this problem which achieves an approximation ratio of ej/2 + o(j). The problem is known to be NP-hard to approximate within a factor of cj for some constant c > 1. Our algorithm also gives a factor ej + o(j) approximation for the problem of finding the principal j x j submatrix of a rank d positive semidefinite matrix with the largest determinant. We achieve our approximation by rounding solutions to a generalization of the D-optimal design problem, or, equivalently, the dual of an appropriate smallest enclosing ellipsoid problem. Our arguments give a short and simple proof of a restricted invertibility principle for determinants.

[1]  Robert M Thrall,et al.  Mathematics of Operations Research. , 1978 .

[2]  Kunal Talwar,et al.  Approximating Discrepancy via Small Width Ellipsoids , 2014 .

[3]  J. Bourgain,et al.  Invertibility of ‘large’ submatrices with applications to the geometry of Banach spaces and harmonic analysis , 1987 .

[4]  Friedrich Eisenbrand,et al.  On largest volume simplices and sub-determinants , 2014, SODA.

[5]  Aleksandar Nikolov,et al.  The geometry of differential privacy: the sparse and approximate cases , 2012, STOC '13.

[6]  E. Chong,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[7]  Jirí Matousek An Lp Version of the Beck-Fiala Conjecture , 1998, Eur. J. Comb..

[8]  G. Nemhauser,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2014 .

[9]  J. Matousek,et al.  The determinant bound for discrepancy is almost tight , 2011, 1101.0767.

[10]  Malik Magdon-Ismail,et al.  Exponential Inapproximability of Selecting a Maximum Volume Sub-matrix , 2011, Algorithmica.

[11]  N. Sheibani,et al.  Paris , 1894, The Hospital.

[12]  C. Rogers,et al.  Absolute and Unconditional Convergence in Normed Linear Spaces. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[13]  F. John Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .

[14]  Venkatesan Guruswami,et al.  Optimal column-based low-rank matrix reconstruction , 2011, SODA.

[15]  R. Vershynin John's decompositions: Selecting a large part , 1999, math/9909110.

[16]  Asa Packer Polynomial-time approximation of largest simplices in V-polytopes , 2004, Discret. Appl. Math..

[17]  László Lovász,et al.  Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..

[18]  D. Spielman,et al.  An elementary proof of the restricted invertibility theorem , 2009, 0911.1114.

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  J. A. Salvato John wiley & sons. , 1994, Environmental science & technology.

[21]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[22]  丸山 徹 Convex Analysisの二,三の進展について , 1977 .

[23]  Peter Gritzmann,et al.  Largest j-Simplices in n-Polytopes , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[24]  Leonid Khachiyan On the Complexity of Approximating Extremal Determinants in Matrices , 1995, J. Complex..

[25]  J. Urry Complexity , 2006, Interpreting Art.

[26]  Luis Rademacher,et al.  Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[27]  Alexander Schrijver,et al.  Matroids, trees, stable sets , 2003 .

[28]  Aravind Srinivasan,et al.  Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems , 1997, SODA '97.

[29]  Peter Gritzmann,et al.  On the complexity of some basic problems in computational convexity: I. Containment problems , 1994, Discret. Math..

[30]  Ji R Matou An L P Version of the Beck-fiala Conjecture , .

[31]  A. Lewis The Convex Analysis of Unitarily Invariant Matrix Functions , 1995 .

[32]  S. Goreinov,et al.  The maximum-volume concept in approximation by low-rank matrices , 2001 .

[33]  Peter Gritzmann,et al.  On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[34]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[35]  Ioannis Koutis,et al.  Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope , 2006, Inf. Process. Lett..

[36]  Leonid Khachiyan,et al.  Rounding of Polytopes in the Real Number Model of Computation , 1996, Math. Oper. Res..

[37]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[38]  K. Ball Volumes of sections of cubes and related problems , 1989 .

[39]  Peter Gritzmann,et al.  Largestj-simplices inn-polytopes , 1995, Discret. Comput. Geom..