Computing global minima to polynomial optimization problems using Gröbner bases
From MaRDI portal
Publication:1904644
Recommendations
- Publication:3470576
- Computing the global optimum of a multivariate polynomial over the reals
- On global optimizations with polynomials
- Solving global optimization problems over polynomials with GloptiPoly 2.1
- A global optimization algorithm for polynomial programming
- Global optimization of polynomials over real algebraic sets
- Global optimality conditions and optimization methods for polynomial programming problems
- Global minimization of a multivariate polynomial using matrix methods
- Global optimization of polynomials restricted to a smooth variety using sums of squares
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- More test examples for nonlinear programming codes
- Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
- Test examples for nonlinear programming codes
Cited in
(12)- Applying Gröbner basis method to multiparametric polynomial nonlinear programming
- Some algebraic methods for solving multiobjective polynomial integer programs
- Semi-algebraically connected components of minimum points of a polynomial function
- Reduction constraints for the global optimization of NLPs
- Algorithms for computing the global infimum and minimum of a polynomial function
- Gröbner bases in asymptotic analysis of perturbed polynomial programs
- Proving inequalities and solving global optimization problems via simplified CAD projection
- scientific article; zbMATH DE number 5926987 (Why is no real title available?)
- Equality-constrained minimization of polynomial functions
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- Global minimization of multivariate polynomials using nonstandard methods
- Reformulations in Mathematical Programming: Definitions and Systematics
This page was built for publication: Computing global minima to polynomial optimization problems using Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904644)