Computing global minima to polynomial optimization problems using Gröbner bases (Q1904644): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01097057 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996338984 / rank
 
Normal rank

Latest revision as of 11:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Computing global minima to polynomial optimization problems using Gröbner bases
scientific article

    Statements

    Computing global minima to polynomial optimization problems using Gröbner bases (English)
    0 references
    0 references
    24 July 1996
    0 references
    local optimality conditions
    0 references
    polynomial optimization
    0 references
    Gröbner bases
    0 references

    Identifiers