Solving the equality-constrained minimization problem of polynomial functions

DOI10.1007/s10898-019-00799-6zbMath1432.90147OpenAlexW2956393884MaRDI QIDQ2010089

Shuijing Xiao, Guangxing Zeng

Publication date: 3 December 2019

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-019-00799-6

zbMATH Keywords

polynomial functionminimum pointtriangular decompositionattainabilitytransfer principleinfimumequality-constrained minimizationrevised resultant

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear programming (90C30) Separable extensions, Galois theory (12F10) Ordered fields (12J15)

Related Items (1)

The invertibility of rational univariate representations

Uses Software

• Maple
• ISOLATE
• Wsolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global optimization of polynomials restricted to a smooth variety using sums of squares
• Algorithms for computing the global infimum and minimum of a polynomial function
• Equality-constrained minimization of polynomial functions
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Solving zero-dimensional systems through the rational univariate representation
• An exact Jacobian SDP relaxation for polynomial optimization
• Polynomial Optimization with Real Varieties
• Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• Algorithms in real algebraic geometry

This page was built for publication: Solving the equality-constrained minimization problem of polynomial functions