Global optimization of polynomials over real algebraic sets
From MaRDI portal
Publication:1730308
DOI10.1007/s11424-019-8351-5zbMath1435.90115OpenAlexW2914422264MaRDI QIDQ1730308
Chu Wang, Zhi-Hong Yang, Lihong Zhi
Publication date: 6 March 2019
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-019-8351-5
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Real algebraic sets (14P05)
Related Items (2)
Uses Software
Cites Work
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- Some applications of polynomial optimization in operations research and real-time decision making
- Global optimization of polynomials restricted to a smooth variety using sums of squares
- Variant quantifier elimination
- Algorithms for computing the global infimum and minimum of a polynomial function
- Global minimization of multivariate polynomials using nonstandard methods
- Proving inequalities and solving global optimization problems via simplified CAD projection
- Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
- Quantitative generalized Bertini-Sard theorem for smooth affine varieties
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- A zero-dimensional approach to compute real radicals
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Partial cylindrical algebraic decomposition for quantifier elimination
- Ehresmann fibrations and Palais-Smale conditions for morphisms of Finsler manifolds
- Computation of real radicals of polynomial ideals. II
- Multivariate polynomial minimization and its application in signal processing
- On the generalized critical values of a polynomial mapping
- Semialgebraic Sard theorem for generalized critical values.
- Open weak CAD and its applications
- Real solving for positive dimensional systems.
- An exact Jacobian SDP relaxation for polynomial optimization
- Recent advances in automated theorem proving on inequalities
- Testing sign conditions on a multivariate polynomial and applications
- Minimizing polynomials via sum of squares over the gradient ideal
- Globally optimal estimates for geometric reconstruction problems
- Global Optimization with Polynomials and the Problem of Moments
- A generalized Sard theorem on real closed fields
- Variant real quantifier elimination
- Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
- Global optimization of polynomials using generalized critical values and sums of squares
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- Constructing fewer open cells by GCD computation in CAD projection
- A Singular Introduction to Commutative Algebra
- QEPCAD B
- On the Complexity of Computing Real Radicals of Polynomial Systems
- Computing the global optimum of a multivariate polynomial over the reals
- Hausdorff Measure of Critical Images on Banach Manifolds
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- The measure of the critical values of differentiable maps
- Algorithms in real algebraic geometry
- An algorithm of global optimization for rational functions with rational constraints
- Improved projection for cylindrical algebraic decomposition
- 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: Global optimization of polynomials over real algebraic sets
