scientific article; zbMATH DE number 2068058

MaRDI QIDQ4464663zbMATH OpenFDO

Authors Jürgen Garloff, Andrew Paul Smith

Publication date 27 May 2004

zbMATH Keywords

Bernstein expansions of multivariate polynomials

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials
• A new method to obtain lower bounds for polynomial evaluation
• Lower bounds for polynomial evaluation and interpolation problems
• On Improved Degree Lower Bounds for Polynomial Approximation.
• Lower bounds for the polynomial calculus
• Lower bound functions for polynomials
• scientific article; zbMATH DE number 2174386
• Refinements of lower bounds for polygamma functions
• Lower bounds for the polynomial calculus and the Gröbner basis algorithm
• A generalized method for proving polynomial calculus degree lower bounds

Cited in

(5)

• Fast construction of constant bound functions for sparse polynomials
• Lower bound functions for polynomials
• On Improved Degree Lower Bounds for Polynomial Approximation.
• Comparison of different bounding sets of polynomial functions defined in a given domain
• A Comparison of Methods for the Computation of Affine Lower Bound Functions for Polynomials

Describes a project that uses

Uses Software

• INTOPT_90

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464663)