Proving Inequalities and Solving Global Optimization Problems via Simplified CAD Projection
Preprint
Abstract
Let $\xx_n=(x_1,\ldots,x_n)$ and $f\in \R[\xx_n,k]$. The problem of finding all $k_0$ such that $f(\xx_n,k_0)\ge 0$ on $\mathbb{R}^n$ is considered in this paper, which obviously takes as a special case the problem of computing the global infimum or proving the semi-definiteness of a polynomial. For solving the problems, we propose a simplified Brown's CAD projection operator, \Nproj, of which the projection scale is always no larger than that of Brown's. For many problems, the scale is much smaller than that of Brown's. As a result, the lifting phase is also simplified. Some new algorithms based on \Nproj\ for solving those problems are designed and proved to be correct. Comparison to some existing tools on some examples is reported to illustrate the effectiveness of our new algorithms.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Minimizing Polynomials via Sum of Squares over the Gradient IdealMathematical Programming, 2005
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic setsmanuscripta mathematica, 2005
- Improved Projection for Cylindrical Algebraic DecompositionJournal of Symbolic Computation, 2001
- Solving Systems of Strict Polynomial InequalitiesJournal of Symbolic Computation, 2000
- Real Quantifier Elimination in Practice1999
- Super-Exponential Complexity of Presburger Arithmetic1998
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991
- Polynomially positive definite sequencesMathematische Annalen, 1982
- Über die Zerlegung definiter Funktionen in QuadrateAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1927
- Ueber die Darstellung definiter Formen als Summe von FormenquadratenMathematische Annalen, 1888