Computing global minima to polynomial optimization problems using Gröbner bases
From MaRDI portal
Publication:1904644
DOI10.1007/BF01097057zbMath0841.90113OpenAlexW1996338984MaRDI QIDQ1904644
Publication date: 24 July 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01097057
Related Items
Gröbner bases in asymptotic analysis of perturbed polynomial programs, Finding multiple Nash equilibria via machine learning-supported Gröbner bases, Equality-constrained minimization of polynomial functions, Algorithms for computing the global infimum and minimum of a polynomial function, Some algebraic methods for solving multiobjective polynomial integer programs, Global minimization of multivariate polynomials using nonstandard methods, Proving inequalities and solving global optimization problems via simplified CAD projection, Reduction constraints for the global optimization of NLPs, Reformulations in Mathematical Programming: Definitions and Systematics, Semi-algebraically connected components of minimum points of a polynomial function, Applying Gröbner basis method to multiparametric polynomial nonlinear programming
Cites Work
