A new inclusion function for optimization: Kite - The one dimensional case

Journal of Global Optimization

Volumn 30, Issue 4, 2004, Pages 435-456

  Vinkó, Tamás ^a   Lagouanelle, Jean Louis ^b   Csendes, Tibor ^a  

^a UNIVERSITY OF SZEGED   (Hungary)

^b IRIT   (France)

Author keywords

Centered form; Inclusion function; Interval global optimization; Pruning

Indexed keywords

ALGORITHMS; AUTOMATION; BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; SET THEORY;

CENTERED FORM; INCLUSION FUNCTION; INTERVAL GLOBAL OPTIMIZATION; PRUNING;

GLOBAL OPTIMIZATION;

EID: 10044273932     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10898-004-8430-5     Document Type: Article

References (21)

1. Alefeld, G. and Herzberger, J. (1983), Introduction to Interval Computations, Academic Press, New York.
2. Baumann, E. (1988), Optimal centered forms, BIT, 28(1), 80-87.
3. Casado, L.G., García, I., Martínez, J.A. and Sergeyev, Ya.D. (2003), New interval analysis support functions using gradient information in a global minimization algorithm, J. Global Optimization, 25(4), 345-362.
4. Csallner, A.E., Csendes, T. and Markót, M.Cs. (2000), Multisection in interval branch-and-bound methods for global optimization - I. Theoretical results, J. Global Optimization, 16(4), 371-392.
5. Csendes, T. (2001), New subinterval selection criteria for interval global optimization, J. Global Optimization, 19(3), 307-327.
6. Csendes, T. and Ratz, D. (1997), Subdivision direction selection in interval methods for global optimization, SIAM J. Numerical Anal., 34(3), 922-938.
7. Hammer, R., Hocks, M., Kulisch, U. and Ratz, D. (1995), C++ Toolbox for Verified Computing I: Basic Numerical Problems: Theory, Algorithms, and Programs, Springer-Verlag, Berlin.
8. Hansen, E.R. (1992), Global Optimization Using Interval Analysis, Marcel Dekker, New York.
9. Kearfott, R.B. (1996), Rigorous Global Search: Continuous Problems, Kluwer, Boston.
10. Klatte, R., Kulisch, U., Wiethoff, A., Lawo, C. and Rauch, M. (1993), C-XSC; A C++ Class Library for Extended Scientific Computing, Springer-Verlag, New York.
11. Krawczyk R. and Nickel, K. (1982), The centered form in interval arithmetics: Quadratic convergence and inclusion isotonicity, Computing, 28(2), 117-137.
12. Lagouanelle, J.-L. (2000), Kite algorithm: A new global interval method from linear evaluations. In: Dietrich, S., Facius, A. and Bierlox, N. (eds.) Abstracts of the SCAN2000 Conference, p. 126. Karlsruhe.
13. Lagouanelle, J.-L. and Messine, F. (1998), Algorithme d'encadrement de l'optimum global d'une fonction différentiable, C. R. Acad. Sci. Paris Sér. I Math., 326(5), 629-632.
14. Messine, F. and Lagouanelle, J.-L. (1998), Enclosure methods for multivariate differentiable functions and application to global optimization, J.UCS: J. Universal Comput. Sci., 4(6), 589-603.
15. Moore, R.E. (1979), Methods and Applications of Interval Analysis, SIAM, Philadelphia.
16. Moore, R.E. (1996), Interval Analysis, Prentice-Hall, Englewood Cliffs.
17. Neumaier, A. (1990), Interval Methods for Systems of Equations, Cambridge University Press, Cambridge.
18. Ratschek, H. and Rokne, J. (1984), Computer Methods for the Range of Functions, Ellis Horwood, Chichester.
19. Ratschek, H. and Rokne, J. (1988), New Computer Methods for Global Optimization, Ellis Horwood, Chichester.
20. Ratz, D. (1999), A nonsmooth global optimization technique using slopes - the one dimensional case, J. Global Optimization, 14(4), 365-393.
21. Sotiropoulos, D.G. and Grapsa, T.N. (2001), A branch-and-prune method for global optimization. In: Kraemer, W. and Gudenberg, J.W.V. (eds). Scientific Computing, Validated Numerics, Interval Methods, Kluwer, Boston, p. 215-226.