Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (Q625645): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-009-9485-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-009-9485-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989986988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of test problems for constrained global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combination of interval constraint solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous global search: continuous problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and safe framework for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate approach of global optimization for polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved interval global optimization algorithm using higher-order inclusion function forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-009-9485-0 / rank
 
Normal rank

Latest revision as of 22:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
scientific article

    Statements

    Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm (English)
    0 references
    0 references
    0 references
    25 February 2011
    0 references
    Bernstein polynomials
    0 references
    constrained global optimization
    0 references
    subdivision
    0 references
    pruning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers