A scaling algorithm for polynomial constraint satisfaction problems

Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of scale in one or more variable may have drastic effects on the robustness of subsequent calculations. This paper surveys scaling algorithms for systems of polynomials from the literature, and discusses some new ones, applicable to arbitrary polynomial constraint satisfaction problems. Keywords. scaling algorithms, constraint satisfaction problems, optimization

• Type: Journal
• Year: 2008
• Where: JGO
• Authors: Ferenc Domes, Arnold Neumaier
• Keywords: Algorithms, JGO 2008, Polynomial, Satisfaction Problems