Abstract
In this article, a solver platform for global optimization is presented, as it is developed in the COCONUT project. After a short introduction, a short description is given of the basic algorithmic concept and of all relevant components, the strategy engine, inference engines, and the remaining modules. A compact description of the search graph and its nodes and of the internal model representation using directed acyclic graphs (DAGs) completes the presentation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benhamou, F., McAllester, D., Van Hentenryck, P.: CLP intervals revisited. In: Bruynooghe, M. (ed.) Proceedings of ILPS 1994, International Logic Programming Symposium, Ithaca, NY, USA, pp. 124–138. MIT Press, Cambridge (1994)
Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer, and boolean constraints. Journal of Logic Programming 32(1), 1–24 (1997)
Brooke, A., Kendrick, D., Meeraus, A.: GAMS - A User’s Guide (Release 2.25). Boyd & Fraser Publishing Company, Danvers (1992)
The COCONUT project home page, http://www.mat.univie.ac.at/coconut
The COCONUT Environment home page, http://www.mat.univie.ac.at/coconutenvironment
Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL — A Mathematical Programming Language, 2nd edn. Thomson (2003)
Kallrath, J. (ed.): Modeling Languages in Mathematical Optimization. Kluwer Academic Publishers, Boston (2003)
Lerch, M., Tischler, G., Wolff von Gudenberg, J.: filib++–Interval Library, Specification and Reference Manual. Informatik, Universität Würzburg, techn. report 279 edition (August 2001)
Sam-Haroud, D., Faltings, B.: Consistency techniques for continuous constraints. Constraints 1, 85–118 (1996)
Schichl, H., Neumaier, A.: Exclusion regions for systems of equations. SIAM J. Num. Analysis (2003) (to appear)
Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization (2003) (preprint)
Siek, J., Lumsdaine, A., Lee, L.-Q.: Generic programming for high performance numerical linear algebra. In: Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO 1998), SIAM Press, Philadelphia (1999)
Silaghi, M., Sam-Haroud, D., Faltings, B.: Search techniques for non-linear CSPS with inequalities. In: Proc. of the 14th Canadian Conf. on AI (2001)
Spellucci, P.: An SQP method for general nonlinear programs using only equality constrained subproblems. Mathematical Programming 82, 413–448 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schichl, H. (2004). Global Optimization in the COCONUT Project. In: Alt, R., Frommer, A., Kearfott, R.B., Luther, W. (eds) Numerical Software with Result Verification. Lecture Notes in Computer Science, vol 2991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24738-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24738-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21260-7
Online ISBN: 978-3-540-24738-8
eBook Packages: Springer Book Archive