Proving inequalities and solving global optimization problems via simplified CAD projection
From MaRDI portal
Publication:492036
DOI10.1016/j.jsc.2015.02.007zbMath1337.90052arXiv1205.1223OpenAlexW2069128675MaRDI QIDQ492036
Bican Xia, Zhi Jin, Jing Jun Han
Publication date: 19 August 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.1223
global optimizationpolynomialssemi-definitenessCAD projectioncylindrical algebraic decomposition (CAD)
Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (5)
Multivariate discriminant and iterated resultant ⋮ Open weak CAD and its applications ⋮ Global optimization of polynomials over real algebraic sets ⋮ Consistency of a range of penalised cost approaches for detecting multiple changepoints ⋮ Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
Uses Software
Cites Work
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Solving systems of polynomial inequalities in subexponential time
- Real quantifier elimination is doubly exponential
- Polynomially positive definite sequences
- Factoring polynomials with rational coefficients
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Partial cylindrical algebraic decomposition for quantifier elimination
- Global minimization of a multivariate polynomial using matrix methods
- Semialgebraic Sard theorem for generalized critical values.
- Computing global minima to polynomial optimization problems using Gröbner bases
- Solving systems of strict polynomial inequalities
- Pólya's theorem with zeros
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Global optimization of polynomials using generalized critical values and sums of squares
- On the Theoretical and Practical Complexity of the Existential Theory of Reals
- Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
- Constructing fewer open cells by GCD computation in CAD projection
- Using Algebraic Geometry
- Algorithms for computing the global in mum and minimum of a polynomial function
- Pólya’s method and the successive difference substitution method
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Computing the global optimum of a multivariate polynomial over the reals
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Algorithms in real algebraic geometry
- Improved projection for cylindrical algebraic decomposition
- Divisors of polynomials and power series with positive coefficients
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Proving inequalities and solving global optimization problems via simplified CAD projection
