Computing global minima to polynomial optimization problems using Gröbner bases

DOI10.1007/BF01097057zbMATH Open0841.90113OpenAlexW1996338984MaRDI QIDQ1904644FDOQ1904644

Yanyan Li

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

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

zbMATH Keywords

polynomial optimizationlocal optimality conditionsGröbner bases

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization

Cited In (12)

• Title not available (Why is that?)
• Algorithms for computing the global infimum and minimum of a polynomial function
• Equality-constrained minimization of polynomial functions
• Reformulations in Mathematical Programming: Definitions and Systematics
• Gröbner bases in asymptotic analysis of perturbed polynomial programs
• Proving inequalities and solving global optimization problems via simplified CAD projection
• Global minimization of multivariate polynomials using nonstandard methods
• Semi-algebraically connected components of minimum points of a polynomial function
• Finding multiple Nash equilibria via machine learning-supported Gröbner bases
• Some algebraic methods for solving multiobjective polynomial integer programs
• Reduction constraints for the global optimization of NLPs
• Applying Gröbner basis method to multiparametric polynomial nonlinear programming

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)