Abstract. This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after suitable preprocessing to arbitrary algebraic constraints.The basic new techniques consist in eliminating bilinear entries from a quadratic constraint, and solving the resulting separable quadratic constraints by means of a sequence of univariate quadratic problems. Care is taken to ensure that all methods correctly account for rounding errors in the computations.
GloptLab is an easy-to-use testing and development platform for solving quadratic constraint satisfaction problems, written in Matlab. The algorithms implemented in GloptLab are used to reduce the search space: scaling, constraint propagation, linear relaxations, strictly convex enclosures, conic methods, and branch and bound. All these methods are rigorous; hence, it is guaranteed that no feasible point is lost. Finding and verifying feasible points complement the reduction methods. From the method repertoire custom-made strategies can be built, with a user-friendly graphical interface. GloptLab was tested on a large test set of constraint satisfaction problems, and the results show the importance of composing a clever strategy.
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.
Abstract. This paper discusses the rigorous enclosure of an ellipsoid by a rectangular box, its interval hull, providing a convenient preprocessing step for constrained optimization problems.A quadratic inequality constraint with a positive definite Hessian defines an ellipsoid. The Cholesky factorization can be used to transform a strictly convex quadratic constraint into a norm inequality, for which the interval hull is easy to compute analytically. In exact arithmetic, the Cholesky factorization of a nonsingular symmetric matrix exists iff the matrix is positive definite. However, to cope efficiently with rounding errors in inexact arithmetic is nontrivial. Numerical tests show that even nearly singular problems can be handled successfully by our techniques.To rigorously account for the rounding errors involved in the computation of the interval hull and to handle quadratic inequality constraints having uncertain coefficients, we define the concept of a directed Cholesky factorization, and give two algorithms for computing one. We also discuss how a directed Cholesky factorization can be used for testing positive definiteness. Some numerical test are given in order to exploit the features and boundaries of the directed Cholesky factorization methods. , combine a number of methods and strategies to find one or more global solutions of a constrained optimization problem. Most of the techniques (e.g branch and bound, heuristics) require explicit bounds for each variable from below and from above. If a problem lacks these explicit prior bounds, the usual remedy is to set default upper and lower bounds on the variables, thereby changing the problem. If the global minimum lies outside the default bounds, the solver cannot find the solution.A rigorous enclosure technique for strictly convex quadratic constraints presented in this paper gives the possibility to obtain rigorous bounds on variables that are consequences of the constraints, without the need of giving explicit bounds on them. This makes the method a convenient preprocessing step for constrained optimization problems. On the other hand since the enclosures obtained by the method are rigorous, the method is also applicable in verified global optimization (e.g., Kearfott [10], Lebbah [11], Domes [7]) and in computer-assisted proofs (see, e.g., Neumaier [14]). Since it reduces the search space, it may also be important for stochastic, samplingbased optimization methods.The paper is logically divided into two parts. The first part (Sections 2 -4) is about computing rigorous enclosures for strictly convex quadratic constraints. In the second part (Sections 5 -7) the theory of the directed Cholesky factorization is developed as an essential tool for making the results of the first part rigorous.In the first section we find an optimal box enclosure of an ellipsoid defined by a simple Euclidean norm inequality constraint. In Section 2 we extend these results and
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.