Combinatorial and algorithmic aspects of hyperbolic polynomials
暂无分享,去创建一个
[1] Leonid Gurvits. The Van der Waerden conjecture for mixed discriminants , 2004 .
[2] Alex Samorodnitsky,et al. A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume , 2000, STOC '00.
[3] L. Gurvits,et al. The Deeation-innation Method for Certain Semideenite Programming and Maximum Determinant Completion Problems , 1998 .
[4] G. Egorychev. The solution of van der Waerden's problem for permanents , 1981 .
[5] Jiří Gregor. On quadratic Hurwitz forms. I , 1981 .
[6] L. Baum,et al. Growth transformations for functions on manifolds. , 1968 .
[7] J. Helton,et al. Linear matrix inequality representation of sets , 2003, math/0306180.
[8] Alex Samorodnitsky,et al. A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary , 2002, Discret. Comput. Geom..
[9] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[10] Vladimir L. Kharitonov,et al. Robust Stability of Multivariate Polynomials, Part 2: Polytopic Coefficient Variations , 1999, Multidimens. Syst. Signal Process..
[11] L. Hörmander. Analysis of Linear Partial Differential Operators II , 2005 .
[12] D. Falikman. Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , 1981 .
[13] Alex Samorodnitsky,et al. A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.
[14] David G. Wagner,et al. Homogeneous multivariate polynomials with the half-plane property , 2004, Adv. Appl. Math..
[15] A. Lewis,et al. The lax conjecture is true , 2003, math/0304104.
[16] B. Dubrovin,et al. Matrix finite-zone operators , 1985 .
[17] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[18] William H. Cunningham,et al. Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra , 1995, SIAM J. Discret. Math..
[19] Leonid Gurvits. Classical deterministic complexity of Edmonds' Problem and quantum entanglement , 2003, STOC '03.
[20] N. Krylov. On the general notion of fully nonlinear second-order elliptic equations , 1995 .
[21] L. Gårding. An Inequality for Hyperbolic Polynomials , 1959 .
[22] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[23] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .
[24] L. Baum,et al. A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains , 1970 .
[25] Ravindra B. Bapat,et al. Mixed discriminants of positive semidefinite matrices , 1989 .
[26] Leonid Gurvits,et al. Combinatorics hidden in hyperbolic polynomials and related topics , 2004 .
[27] U. Rothblum,et al. On complexity of matrix scaling , 1999 .
[28] Alexander I. Barvinok,et al. Two Algorithmic Results for the Traveling Salesman Problem , 1996, Math. Oper. Res..
[29] Leonid Gurvits,et al. Classical complexity and quantum entanglement , 2004, J. Comput. Syst. Sci..
[30] Heinz H. Bauschke,et al. Hyperbolic Polynomials and Convex Analysis , 2001, Canadian Journal of Mathematics.
[31] Osman Güler,et al. Hyperbolic Polynomials and Interior Point Methods for Convex Programming , 1997, Math. Oper. Res..
[32] V. Vinnikov. Self-adjoint determinantal representations of real plane curves , 1993 .
[33] L. Bregman. Proof of the convergence of Sheleikhovskii's method for a problem with transportation constraints , 1967 .