Fast construction of constant bound functions for sparse polynomials (Q1029674): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-007-9195-4 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-007-9195-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2131845859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous convex underestimators for general twice-differentiable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe and tight linear estimators for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bernstein form of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for polynomials in Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound functions for polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous global search: continuous problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe bounds in linear and mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bézier and B-spline techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily high degree elevation of Bézier representations / 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-007-9195-4 / rank
 
Normal rank

Latest revision as of 13:52, 10 December 2024

scientific article
Language Label Description Also known as
English
Fast construction of constant bound functions for sparse polynomials
scientific article

    Statements

    Fast construction of constant bound functions for sparse polynomials (English)
    0 references
    0 references
    13 July 2009
    0 references
    constrained global optimization
    0 references
    Bernstein polynomials
    0 references
    multivariate polynomials
    0 references
    lazy evaluation
    0 references
    interval arithmetic
    0 references
    relaxation
    0 references
    bound functions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers