Convergence of the Simplicial Rational Bernstein Form

DOI10.1007/978-3-319-18161-5_37zbMath1370.90174OpenAlexW2296409857MaRDI QIDQ5357007

Jihad Titi, Tareq Hamadneh, Jürgen Garloff

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_37

zbMATH Keywords

subdivisionrational functionsimplexBernstein polynomialdegree elevationrange bounds

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Related Items (2)

Numerical optimization and positivity certificates for polynomials and rationals over simplices ⋮ Matrix methods for the simplicial Bernstein representation and for the evaluation of multivariate polynomials

Cites Work

• Unnamed Item
• The Bernstein polynomial basis: a centennial retrospective
• On the complexity of optimization over the standard simplex
• Certificates of positivity in the Bernstein basis
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• On the minimum of a positive polynomial over the standard simplex
• A PTAS for the minimization of polynomials of fixed degree over the simplex
• Convergence and Inclusion Isotonicity of the Tensorial Rational Bernstein Form

This page was built for publication: Convergence of the Simplicial Rational Bernstein Form