An efficient algorithm for range computation of polynomials using the Bernstein form (Q1037369): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(9 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-008-9382-y / rank
Normal rank
 
Property / author
 
Property / author: Paluri S. V. Nataraj / rank
Normal rank
 
Property / author
 
Property / author: Paluri S. V. Nataraj / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Database of Polynomial Systems / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: INTOPT_90 / 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-008-9382-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092808221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust arithmetic for multivariate Bernstein-form polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4209232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical condition of polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound functions for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of filled functions for finding global minimizers of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The globally convexized filled functions for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4277813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear equations and optimization / 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: Semidefinite Approximations for Global Unconstrained Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous global search: continuous 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: Q3207999 / 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: Q4428719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for identifying global and local minima when optimizing functions with many minima. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for global optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-008-9382-Y / rank
 
Normal rank

Latest revision as of 14:17, 10 December 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for range computation of polynomials using the Bernstein form
scientific article

    Statements

    An efficient algorithm for range computation of polynomials using the Bernstein form (English)
    0 references
    0 references
    0 references
    16 November 2009
    0 references
    Bernstein polynomials
    0 references
    global optimization
    0 references
    interval analysis
    0 references
    polynomial optimization
    0 references
    range computation
    0 references
    0 references
    0 references
    0 references

    Identifiers