Proving inequalities and solving global optimization problems via simplified CAD projection
- 1 January 2016
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 72, 206-230
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- President's Fund for Undergraduate Students of Peking University
- NSFC (11290141)
- NSFC (11271034)
- SKLCS (SYSKF1207)
This publication has 27 references indexed in Scilit:
- Pólya’s method and the successive difference substitution methodSCIENTIA SINICA Mathematica, 2012
- Pólya’s Theorem with zerosJournal of Symbolic Computation, 2011
- Algorithms for computing the global in mum and minimum of a polynomial functionSCIENTIA SINICA Mathematica, 2011
- Minimizing Polynomials via Sum of Squares over the Gradient IdealMathematical Programming, 2005
- Computing global minima to polynomial optimization problems using Gröbner basesJournal of Global Optimization, 1995
- On the Theoretical and Practical Complexity of the Existential Theory of RealsThe Computer Journal, 1993
- Solving Polynomial Strict Inequalities Using Cylindrical Algebraic DecompositionThe Computer Journal, 1993
- Solving systems of polynomial inequalities in subexponential timeJournal of Symbolic Computation, 1988
- Real quantifier elimination is doubly exponentialJournal of Symbolic Computation, 1988
- Divisors of polynomials and power series with positive coefficientsPacific Journal of Mathematics, 1969