Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming
暂无分享,去创建一个
[1] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.
[2] Didier Henrion,et al. GloptiPoly 3: moments, optimization and semidefinite programming , 2007, Optim. Methods Softw..
[3] Timo de Wolff,et al. Amoebas, nonnegative polynomials and sums of squares supported on circuits , 2014, 1402.0462.
[4] Jean B. Lasserre. Sufficient conditions for a real polynomial to be a sum of squares , 2006 .
[5] B. Reznick. Forms derived from the arithmetic-geometric inequality , 1989 .
[6] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[7] Peter J. C. Dickinson,et al. On the computational complexity of membership problems for the completely positive cone and its dual , 2014, Comput. Optim. Appl..
[8] Rekha R. Thomas,et al. Semidefinite Optimization and Convex Algebraic Geometry , 2012 .
[9] M. Laurent. Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .
[10] Stephen P. Boyd,et al. A tutorial on geometric programming , 2007, Optimization and Engineering.
[11] Mehdi Ghasemi,et al. Lower Bounds for a Polynomial on a basic closed semialgebraic set using geometric programming , 2013 .
[12] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[13] Mehdi Ghasemi,et al. Lower Bounds for Polynomials Using Geometric Programming , 2012, SIAM J. Optim..
[14] D. Hilbert,et al. Ueber die Darstellung definiter Formen als Summe von Formenquadraten , 1888 .
[15] Carla Fidalgo,et al. Positive semidefinite diagonal minus tail forms are sums of squares , 2011 .