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

DOI10.1007/BF01097057MaRDI QIDQ1904644zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Gröbner baseslocal optimality conditionspolynomial optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 4137921
• 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

(13)

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

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)