Stability index method for global minimization

Journal of Global Optimization

Volumn 36, Issue 2, 2006, Pages 307-318

  Dover, James ^a   Gutman, Semion ^a  

^a UNIVERSITY OF OKLAHOMA   (United States)

Author keywords

Global minimization; Random sample; Stability index

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; NORMAL DISTRIBUTION; RANDOM PROCESSES; SET THEORY;

COMPUTATIONAL RESULTS; RANDOM SAMPLE; STABILITY INDEX METHOD (SIM); TEST FUNCTIONS;

GLOBAL OPTIMIZATION;

EID: 33747655704     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-006-9010-7     Document Type: Article

References (9)

1. Bagirov, A.M., Rubinov, A.M. and Zhang, J. (2005), Local optimization method with global multidimensional search. Journal of Global Optimization 32, 161-179.
2. Bornemann, F., Laurie, D., Wagon, S. and Waldvogel, J. (2004), The SIAM 100-Digit Challenge: A Study in High-Accuracy Numerical Computing. Society for Industrial and Applied Mathematics, Philadelphia.
3. Brent, P. (1973), Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs, NJ.
4. Gutman, S., Ramm, A.G. and Scheid, W. (2002), Inverse scattering by the stability index method, Journal of Inverse and Ill-Posed Problems 10(N5), 487-502.
5. Kirkpatrick, S. (1984), Optimization by simulated annealing: quantitative studies, Journal of Statistical Physics 34, 975-986.
6. Miller, R.E. (2000), Optimization: Foundations and Applications, Wiley, New York.
7. Press, W.H., Teukolsky, S.A., Vetterling, W.T. and Flannery, B.P. (1992), Numerical Recepies in FORTRAN, Second edition. Cambridge University Press, Cambridge.
8. Ramm, A.G. and Gutman, S. (2005), Optimization methods in direct and inverse scattering, In: Jeyakumar, V. and Rubinov, A.M. (eds), Continuous Optimization: Current Trends and Modern Applications. Springer, New York, pp. 51-110.
9. Yin, K.F.C., Liu, Y. and Teo, K.L. (2004), A hybrid descent method for global optimization, Journal of Global Optimization 28, 229-238.