GlobSol: History, composition, and advice on use

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2861, Issue , 2003, Pages 17-31

  Kearfott, R Baker ^a  

^a UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

Author keywords

Automatic differentiation; Constraint propagation; GlobSol; Interval analysis; Verified global optimization

Indexed keywords

GLOBAL OPTIMIZATION;

AUTOMATIC DIFFERENTIATIONS; CONSTRAINED GLOBAL OPTIMIZATION; CONSTRAINT PROPAGATION; DEVELOPMENT HISTORY; GLOBSOL; INTERVAL ANALYSIS;

CONSTRAINED OPTIMIZATION;

EID: 0242460224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39901-8_2     Document Type: Review

References (33)

1. M. Berz, C. Bischof, G. Corliss, and A. Griewank, editors. Computational Differentiation: Techniques, Applications, and Tools, Philadelphia, 1996. SIAM.
2. G. Corliss, Ch. Faure, A. Griewank, L. Hascoët, and U. Naumann, editors. Automatic Differentiation of Algorithms: From Simulation to Optimization, New York, 2002. Springer-Verlag.
3. G. F. Corliss and R. B. Kearfott. Rigorous global search: Industrial applications. In Developments in Reliable Computing, pages 1-16, Dordrecht, Netherlands, 2000. Kluwer.
4. J. E. Dennis and R. B. Schnabel. Numerical Methods for Unconstrained Optimization and Nonlinear Least Squares. Prentice-Hall, Englewood Cliffs, NJ, 1983.
5. C.-Y. Gau and M. A. Stadtherr. Nonlinear parameter estimation using interval analysis. AIChE Symp. Ser, 94(304):445-450, 1999.
6. P. E. Gill, W. Murray, and M. Wright. Practical Optimization. Academic Press, New York, 1981.
7. A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics. SIAM, Philadelphia, 2000.
8. A. Griewank. ADOL-C, a package for automatic differentiation of algorithms written in C/C++, 2002. http://www.mata.tu-dresden.de/wir/project/adolc/.
9. A. Griewank and ed. Corliss, G. F., editors. Automatic Differentiation of Algorithms: Theory, Implementation, and Application, Philadelphia, 1991. SIAM.
10. E. R. Hansen. Global Optimization Using Interval Analysis. Marcel Dekker, Inc., New York, 1992.
11. J. Hoefkens. Rigorous Numerical Analysis with High-Order Taylor Models. PhD thesis, Department of Mathematics, Michigan State University, 2001.
12. R. B. Kearfott. Abstract generalized bisection and a cost bound. Math. Comp., 49(179):187-202, July 1987.
13. R. B. Kearfott. Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems. Computing, 47(2):169-191, 1991.
14. R. B. Kearfott. An interval branch and bound algorithm for bound constrained optimization problems. Journal of Global Optimization, 2:259-280, 1992.
15. R. B. Kearfott. Algorithm 763: INTERVAL_ARITHMETIC: A Fortran 90 module for an interval data type. ACM Trans. Math. Software, 22(4):385-392, December 1996.
16. R. B. Kearfott. Rigorous Global Search: Continuous Problems. Kluwer, Dordrecht, Netherlands, 1996.
17. R. B. Kearfott. Empirical evaluation of innovations in interval branch and bound algorithms for nonlinear algebraic systems. SIAM J. Sci. Comput., 18(2):574-594, March 1997.
18. R. B. Kearfott. On proving existence of feasible points in equality constrained optimization problems. Math. Prog., 83(1):89-100, September 1998.
19. R. B. Kearfott. Interval analysis: Interval Newton methods. In Encyclopedia of Optimization, volume 3, pages 76-78. Kluwer, 2001.
20. R. B. Kearfott, M. Dawande, K.-S. Du, and C.-Y. Hu. Algorithm 737: INTLIB, a portable FORTRAN 77 interval standard function library. ACM Trans. Math. Software, 20(4):447-459, December 1994.
21. R. B. Kearfott and J. Dian. An iterative method for finding approximate feasible points, 1998. preprint, http://interval.louisiana.edu/GlobSol/Dian-approximate-optimizer.pdf.
22. R. B. Kearfott and M. Novoa. Algorithm 681: INTBIS, a portable interval Newton/bisection package. ACM Trans. Math. Software, 16(2):152-157, June 1990.
23. R. B. Kearfott and Walster G. W. Symbolic preconditioning with Taylor models: Some examples, 2001. accepted for publication in Reliable Computing.
24. R. B. Kearfott and G. W. Walster. On stopping criteria in verified nonlinear systems or optimization algorithms. ACM Trans. Math. Software, 26(3):373-389, September 2000.
25. G. Lemaréchal. Nondifferentiable optimization. In M. J. D. Powell, editor, Nonlinear Optimization 1981, pages 85-89, New York, 1982. Academic Press.
26. A. P. Morgan. Solving Polynomial Systems Using Continuation for Engineering and Scie ntific Problems. Prentice-Hall, Englewood Cliffs, NJ, 1987.
27. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press, Cambridge, England, 1990.
28. L. B. Rall. Automatic Differentiation: Techniques and Applications. Lecture Notes in Computer Science no. 120. Springer, Berlin, New York, etc., 1981.
29. D. Ratz and T. Csendes. On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Global Optim., 7:183-207, 1995.
30. C. A. Schnepper. Large Grained Parallelism in Equation-Based Flowsheeting Using Interval Newton / Generalized Bisection Techniques. PhD thesis, University of Illinois, Urbana, 1992.
31. P. Van Hentenryck, L. Michel, and Y. Deville. Numerica: A Modeling Language for Global Optimization. MIT Press, Cambridge, MA, 1997.
32. R. J. Van Iwaarden. An Improved Unconstrained Global Optimization Algorithm. PhD thesis, University of Colorado at Denver, 1996.
33. J. Yang and R. B. Kearfott. Interval linear and nonlinear regression: New paradigms, implementations, and experiments, or new ways of thinking about data fitting, 2002, available at http://interval.louisiana.edu/preprints/2002_SIAM_minisymposium.pdf.