Pages that link to "Item:Q1904644"
From MaRDI portal
The following pages link to Computing global minima to polynomial optimization problems using Gröbner bases (Q1904644):
Displaying 11 items.
- Algorithms for computing the global infimum and minimum of a polynomial function (Q424330) (← links)
- Global minimization of multivariate polynomials using nonstandard methods (Q453625) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Some algebraic methods for solving multiobjective polynomial integer programs (Q633078) (← links)
- Semi-algebraically connected components of minimum points of a polynomial function (Q741867) (← links)
- Gröbner bases in asymptotic analysis of perturbed polynomial programs (Q857824) (← links)
- Equality-constrained minimization of polynomial functions (Q892787) (← links)
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
- Applying Gröbner basis method to multiparametric polynomial nonlinear programming (Q2332342) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Reduction constraints for the global optimization of NLPs (Q4654430) (← links)
