- | ||||
|
![]()
|
A scaling algorithm for polynomial constraint satisfaction problems
Ferenc Domes (ferenc.domes 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 Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization ) Citation: 2008, University of Vienna Download: [PDF] Entry Submitted: 02/28/2008 Modify/Update this entry | ||
Visitors | Authors | More about us | Links | |
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository
|
Submit Update Policies |
Coordinator's Board Classification Scheme Credits Give us feedback |
Optimization Journals, Sites, Societies | |
![]() |