Affiliation:
1. Escuela de Informática y Telecomunicaciones, Universidad Diego Portales, Santiago 8370068, Chile
2. Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Valparaíso 2340000, Chile
Abstract
The performance of branch-and-bound algorithms for solving non-convex optimization problems greatly depends on convex relaxation techniques. They generate convex regions which are used for improving the bounds of variable domains. In particular, convex polyhedral regions can be represented by a linear system A.x=b. Then, bounds of variable domains can be improved by minimizing and maximizing variables in the linear system. Reducing or contracting optimally variable domains in linear systems, however, is an expensive task. It requires solving up to two linear programs for each variable (one for each variable bound). Suboptimal strategies, such as preconditioning, may offer satisfactory approximations of the optimal reduction at a lower cost. In non-square linear systems, a preconditioner P can be chosen such that P.A is close to a diagonal matrix. Thus, the projection of the equivalent system P.A.x=P.b over x, by using an iterative method such as Gauss–Seidel, can significantly improve the contraction. In this paper, we show how to generate an optimal preconditioner, i.e., a preconditioner that helps the Gauss–Seidel method to optimally reduce the variable domains. Despite the cost of generating the preconditioner, it can be re-used in sub-regions of the search space without losing too much effectiveness. Experimental results show that, when used for reducing domains in non-square linear systems, the approach is significantly more effective than Gauss-based elimination techniques. Finally, the approach also shows promising results when used as a component of a solver for non-convex optimization problems.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference29 articles.
1. Bertsekas, D. (2016). Nonlinear Programming, Athena Scientific. [3rd ed.]. Available online: http://www.athenasc.com/nonlinbook.html.
2. Boyd, S.P., and Vandenberghe, L. (2004). Convex Optimization, Cambridge University Press.
3. Interval branch-and-bound algorithms for optimization and constraint satisfaction: A survey and prospects;Araya;J. Glob. Optim.,2016
4. Locatelli, M., and Schoen, F. (2013). Global Optimization: Theory, Algorithms and Applications, SIAM.
5. Araya, I., Trombettoni, G., and Neveu, B. (June, January 28). A contractor based on convex interval taylor. Proceedings of the International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, Nantes, France.