Lower bound functions for polynomials (Q1405189): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rigorous convex underestimators for general twice-differentiable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bernstein form of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnung von Schranken für den Wertebereich eines Polynoms in einem Intervall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the (GOP) algorithm for a large class of smooth optimization problems / 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: Q3732843 / 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: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined method for enclosing all solutions of nonlinear systems of polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3811600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasiconvex relaxations based on interval arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous Lower and Upper Bounds in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized refinable enclosures of multivariate polynomial pieces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Box-bisection for solving second-degree systems and the problem of clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval Methods for Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for an interval polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal computation of the Bernstein algorithm for the bound of an interval polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorization of analytic functions and its verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error estimates for approximations from control nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion / rank
 
Normal rank

Latest revision as of 10:22, 6 June 2024

scientific article
Language Label Description Also known as
English
Lower bound functions for polynomials
scientific article

    Statements

    Lower bound functions for polynomials (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2003
    0 references
    The authors investigate the relaxation techniques for solving nonlinear systems and global optimisation problems. They consider the lower bound functions in the case of problems involving multivariate polynomials. These functions are constructed by using Bernstein expansion. An error bound exhibiting quadratic convergence in the univariate case and some numerical examples are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    relaxation techniques
    0 references
    global optimisation
    0 references
    polynomials
    0 references
    nonlinear systems
    0 references
    lower bound functions
    0 references
    Bernstein expansion
    0 references
    error bound
    0 references
    convergence
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references