Abstract
This paper presents new techniques for filtering boxes in the presence of an additional quadratic constraint, a problem relevant for branch and bound methods for global optimization and constraint satisfaction. This is done by generating powerful linear and parabolic relaxations from a quadratic constraint and bound constraints, which are then subject to standard constraint propagation techniques. The techniques are often applicable even if the original box is unbounded in some but not all variables. As an auxiliary tool—needed to make our theoretical results implementable in floating-point arithmetic without sacrificing mathematical rigor—we extend the directed Cholesky factorization from Domes and Neumaier (SIAM J Matrix Anal Appl 32:262–285, 2011) to a partial directed Cholesky factorization with pivoting. If the quadratic constraint is convex and the initial bounds are sufficiently wide, the final relaxation and the enclosure are optimal up to rounding errors. Numerical tests show the usefulness of the new factorization methods in the context of filtering.
Similar content being viewed by others
References
Domes, F., Fuchs, M., Schichl, H., Neumaier, A.: The optimization test environment. Optim. Eng. 15, 443–468 (2014). http://www.mat.univie.ac.at/~dferi/testenv.html
Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15, 404–429 (2010). http://www.mat.univie.ac.at/~dferi/research/Propag.pdf
Domes, F., Neumaier, A.: Rigorous enclosures of ellipsoids and directed Cholesky factorizations. SIAM J. Matrix Anal. Appl. 32, 262–285 (2011). http://www.mat.univie.ac.at/~dferi/research/Cholesky.pdf
Domes, F., Neumaier, A.: Constraint aggregation in global optimization. In: Mathematical Programming pp. 1–27, (2014). Online First. http://www.mat.univie.ac.at/~dferi/research/Aggregate.pdf
Domes, F., Neumaier, A.: Directed modified Cholesky factorization and ellipsoid relaxations. Technical report, University of Vienna, (2014). http://www.mat.univie.ac.at/~dferi/research/Modchol.pdf
Domes, F., Neumaier, A.: JGloptLab: a rigorous global optimization software (in preparation) (2014). http://www.mat.univie.ac.at/~dferi/publications.html
Domes, F., Neumaier, A.: Rigorous verification of feasibility. J. Glob. Optim. pp. 1–24, (2014). http://www.mat.univie.ac.at/~dferi/research/Feas_csp.pdf
Frommer, A., Hashemi, B.: Verified stability analysis using the lyapunov matrix equation. Electron. Trans. Numer. Anal. 40, 187–203 (2013)
Hansen, E.R.: Global Optimization Using Interval Analysis. Marcel Dekker Inc., New York (1992)
Kearfott, R.B.: On proving existence of feasible points in equality constrained optimization problems. Math. Program. 83(1–3), 89–100 (1995). http://interval.louisiana.edu/preprints/constrai.pdf
Kearfott, R.B., Nakao, M.T., Neumaier, A., Rump, S.M., Shary, S.P., van Hentenryck, P.: Standardized notation in interval analysis. In: Proceedings of XIII Baikal International School-seminar “Optimization methods and their applications”, Vol 4, pp. 106–113. Irkutsk: Institute of Energy Systems, Baikal (2005)
Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57(1), 3–50 (2013). doi:10.1007/s10898-012-9874-7
Misener, R., Floudas, C.A.: ANTIGONE: algorithms for coNTinuous/integer global optimization of nonlinear equations. J. Glob. Optim. 59(2–3), 503–526 (2014). doi:10.1007/s10898-014-0166-2
Neumaier, A., Shcherbina, O., Huyer, W., Vinkó, T.: A comparison of complete global optimization solvers. Math. Program. B 103, 335–356 (2005)
Schichl, H., Markót, M.C.: Algorithmic differentiation techniques for global optimization in the COCONUT environment. Optim. Methods Softw. 27(2), 359–372 (2012). http://www.mat.univie.ac.at/~herman/papers/griewank.pdf
Schichl, H., Markót, M.C., Neumaier, A., Vu, X.-H., Keil, C.: The COCONUT environment, 2000–2010. Software. http://www.mat.univie.ac.at/coconut-environment
Schichl, H., Neumaier, A., Markót, M., Domes, F.: On solving mixed-integer constraint satisfaction problems with unbounded variables. In: Gomes, C., Sellmann, M. (eds) Integration of AI and OR Techniques in constraint programming for combinatorial optimization problems, volume 7874 of lecture notes in computer science, pp. 216–233. Springer, Berlin (2013). http://www.mat.univie.ac.at/~dferi/research/cpaior2013.pdf
Schnabel, R.B., Eskow, E.: A new modified Cholesky factorization. SIAM J. Sci. Stat. Comput. 11(6), 1136–1158 (1990)
Schnabel, R.B., Eskow, E.: A revised modified Cholesky factorization algorithm. SIAM J. Optim. 9(4), 1135–1148 (1999)
Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., Nguyen, T.-V.: Benchmarking global optimization and constraint satisfaction codes. In: Bliek, Ch., Jermann, Ch., Neumaier, A. (eds) Global Optimization and Constraint Satisfaction, pp. 211–222. Springer (2003). http://www.mat.univie.ac.at/~neum/ms/bench.pdf
Wächter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25–57 (2006). doi:10.1007/s10107-004-0559-y
Acknowledgments
This research was supported by the Austrian Science Fund (FWF) under the Contract Numbers P23554-N13 and P22239-N13.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Domes, F., Neumaier, A. Linear and parabolic relaxations for quadratic constraints. J Glob Optim 65, 457–486 (2016). https://doi.org/10.1007/s10898-015-0381-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-015-0381-5
Keywords
- Quadratic constraints
- Non-convex constraints
- Interval analysis
- Constraint satisfaction problems
- Parabolic relaxations
- Ellipsoid relaxations
- Linear relaxations
- Interval hull
- Directed modified Cholesky factorization
- Rounding error control
- Verified computing