Evolution and Optimum Seeking

References 273
Gill, P.E., W. Murray (1972), Quasi-Newton methods for unconstrained optimization,
JIMA 9, 91-108
Ginsburg, T. (1963), The conjugate gradient method, Numer. Math. 5, 191-200
Girsanov, I.V. (1972), Lectures on mathematical theory of extremum problems, Springer,
Berlin
Glass, H., L. Cooper (1965), Sequential search|a method for solving constrained optimization
problems, JACM 12, 71-82
Glover, F. (1986), Future paths for integer programming and links to arti cial intelligence,
Comp. Oper. Res. 13, 533-549
Glover, F. (1989), Tabu search|part I, ORSA-J. on Computing 1, 190-206
Glover, F., H.-J. Greenberg (1989), New approaches for heuristic search|a bilateral
linkage with arti cial intelligence, Europ. J. Oper. Res. 39, 119-130
Gnedenko, B.W. (1970), Lehrbuch der Wahrscheinlichkeitsrechnung, 6th ed., Akademie-
Verlag, Berlin
Goldberg, D.E. (1989), Genetic algorithms in search, optimization, and machine learning,
Addison-Wesley, Reading MA
Goldfarb, D. (1969), Su cient conditions for the convergence of a variable metric algorithm,
in: Fletcher (1969a), pp. 273-282
Goldfarb, D. (1970), A family of variable-metric methods derived by variational means,
Math. Comp. 24, 23-26
Goldfeld, S.M., R.E. Quandt, H.F. Trotter (1966), Maximization by quadratic hillclimbing,
Econometrica 34, 541-551
Goldfeld, S.M., R.E. Quandt, H.F. Trotter (1968), Maximization by improved quadratic
hill-climbing and other methods, Princeton University, Econometric Research Program,
research memo. RM-95, Princeton NJ, April 1968
Goldstein, A.A. (1962), Cauchy's method of minimization, Numer. Math. 4, 146-150
Goldstein, A.A. (1965), On Newton's method, Numer. Math. 7, 391-393
Goldstein, A.A., J.F. Price (1967), An e ective algorithm for minimization, Numer.
Math. 10, 184-189
Goldstein, A.A., J.F. Price (1971), On descent from local minima, Math. Comp. 25,
569-574
Golinski, J., Z.K. Lesniak (1966), Optimales Entwerfen von Konstruktionen mit Hilfe
der Monte-Carlo-Methode, Bautechnik 43, 307-311