Hyperbolic polynomials approach to van der Waerden/Schrijver-Valiant like conjectures: Sharper bounds, simpler proofs and algorithmic applications

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 417-426

  Gurvits, Leonid ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Convex Optimization; Graph; Hyperbolic Polynomials; Permanent

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING; VECTORS;

CONVEX OPTIMIZATION; HYPERBOLIC POLYNOMIALS; PERMANENT;

NUMERICAL METHODS;

EID: 33748122664     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. H. Aslaksen, Quaternionic Determinants, The Math. Intel. 18, No. 3, 57-65
2. A. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes (in Russian), Mat. Sb. (N.S.) 3 (1938), 227-251.
3. R. B. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra and its Applications 126, 107-124, 1989.
4. A. I. Barvinok, Two algorithmic results for the Traveling Salesman Problem, Math. Oper. Res. 21 (1996), 65-84 (2001 version from researchindex.com).
5. A. I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Permanents, Discrete & Computational Geometry, 18 (1997), 205-237.
6. A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms, 14 (1999), 29-61.
7. H.H. Bauschke, O. Guler, A.S. Lewis and H.S. Sendov, Hyperbolic polynomials and Convex analysis, Canad. J. Math. Vol 53, 2001, 470-488.
8. Y.-B. Choe, J.G. Oxley, A. D. Sokal and D.G. Wagner, Homogeneous mltivariate polynomials with the half plane property, Advances in Applied Mathematics 32 (2004), 88-187.
9. G.P. Egorychev, The solution of van der Waerden's problem for permanents, Advances in Math., 42, 299-305, 1981.
10. D. I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki 29, 6: 931-938, 957, 1981, (in Russian).
11. L.Garding, An inequality for hyperbolic polynomials, Jour, of Math. and Mech., 8(6): 957-965, 1959.
12. M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
13. O. Guler, Hyperbolic polynomials and interior point methods for convex programming, Math. Oper. Res. (2) 22(1997), 350-377.
14. L. Gurvits. Combinatorics hidden in hyperbolic polynomials and related topics, preprint (2004), available at http://xxx.lanl.gov/abs/math.CO/0402088.
15. L. Gurvits, Combinatorial and algorithmic aspects of hyperbolic polynomials, 2004; available at http://xxx.lanl.gov/abs/math.CO/0404474.
16. L.Gurvits and A. Samorodnitsky, A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume, Proc. 32 ACM Symp. on Theory of Computing, ACM, New York, 2000.
17. L.Gurvits and A. Samorodnitsky, A deterministic algorithm approximating the mixed discriminant and mixed volume, and a combinatorial corollary, Discrete Comput. Geom. 27: 531 -550, 2002.
18. L.Gurvits and P.Yianilos, The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems, NECI technical report, 1998.
19. L. Gurvits, Van der Waerden Conjecture for Mixed Discriminants, Advances in Mathematics, 2005. (Available at the journal web page.)
20. L. Gurvits, Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures : Sharper Bounds, Simpler Proofs and Algorithmic Applications, 2005 ; available at http://xxx.lanl.gov/abs/math.CO/ 0510452.
21. L. Hormander, Analysis of Linear Partial Differential Operators, Springer-Verlag, New York, Berlin, 1983
22. A.G. Khovanskii, Analogues of the Aleksandrov-Fenchel inequalities for hyperbolic forms, Soviet Math. Dokl. 29(1984), 710-713.
23. A.S. Lewis, P.A. Parrilo, M.V. Ramana, The Lax conjecture is true, 2003 preprint.
24. N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
25. B.D.McKay, I.M. Wanless, Maximising the permanent of (0, 1)-matrices and the number of extensions of Latin rectangles, Electron. J. Combin. 5 (1998) : Research Paper 11, 20 pp. (electronic).
26. H.Minc, Permanents, Addison-Wesley, Reading, MA, 1978.
27. N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
28. A. Nemirovski and U. Rothblum, On complexity of matrix scaling, Linear Algebra Appl. 302/303, 435-460, 1999.
29. Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
30. J. Renegar, Hyperbolic programs, and their derivative relaxations, 2004 ; to appear in Foundations of Computational Mathematics (FOCM) ; available at http://www.optimization-online.org.
31. R. Schneider, Convex bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and Its Applications, vol. 44, Cambridge University Press, New York, 1993.
32. A. Schrijver and W.G. Valiant, On lower bounds for permanents, Indagationes Mathematicae 42 (1980) 425-427
33. A. Schrijver, Counting 1-factors in regular bipartite graphs, Journal of Combinatorial Theory, Series B 72 (1998) 122-135.
34. M. Voorhoeve, A lower bound for the permanents of certain (0,1) matrices, Indagationes Mathematicae 41 (1979) 83-86.