暂无分享,去创建一个
[1] Pablo A. Parrilo,et al. Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..
[2] Yang Lu,et al. Difference substitution and automated inequality proving , 2006 .
[3] Jean B. Lasserre,et al. Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..
[4] James R. Munkres,et al. Elements of algebraic topology , 1984 .
[5] David Handelman. Deciding eventual positivity of polynomials , 1986 .
[6] Yong Yao. Termination of the Sequence of SDS Sets and Machine Decision for Positive Semi-definite Forms , 2009, ArXiv.
[7] P. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .
[8] G. Pólya,et al. Problems and theorems in analysis , 1983 .
[9] R. Ho. Algebraic Topology , 2022 .
[10] John P. D'Angelo,et al. Positivity conditions for bihomogeneous polynomials , 1997 .
[11] Lu Yang,et al. Solving Harder Problems with Lesser Mathematics , 2005 .