Computing global minima to polynomial optimization problems using Gröbner bases
type: Item
instance of: scholarly article
title: Computing global minima to polynomial optimization problems using Gröbner bases
zbMATH Open document ID: 0841.90113
DOI: 10.1007/BF01097057
author: Yanyan Li
published in: Journal of Global Optimization
publication date: 1996-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 829906
zbMATH Keywords: local optimality conditions
zbMATH Keywords: polynomial optimization
zbMATH Keywords: Gröbner bases
MaRDI profile type: Publication
cites work: Q3134873
cites work: Q4023642
cites work: Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
cites work: Test examples for nonlinear programming codes
cites work: More test examples for nonlinear programming codes
full work available at URL: https://doi.org/10.1007/bf01097057
OpenAlex ID: W1996338984
Recommended article: Q3470576
Recommended article: Computing the global optimum of a multivariate polynomial over the reals
Recommended article: On global optimizations with polynomials
Recommended article: Global Optimization and Constraint Satisfaction
Recommended article: Q5197301
Recommended article: Global optimization of polynomials over real algebraic sets
Recommended article: Global optimality conditions and optimization methods for polynomial programming problems
Recommended article: Global minimization of a multivariate polynomial using matrix methods
Recommended article: Global optimization of polynomials restricted to a smooth variety using sums of squares
description: scientific article; zbMATH DE number 829906