Bibliography

1

L. Lamport.
L^ATEX A Document Preparation System.
Addison-Wesley, 1986.

2

R.Brun.
HBOOK users guide (Version 4.15), Program Library Y250.
CERN, 1992.

3

R.Brun, O.Couet, C.Vandoni, and P.Zanarini.
PAW users guide, Program Library Q121.
CERN, 1991.

4

F.James.
Determining the statistical Significance of experimental Results.
Technical Report DD/81/02 and CERN Report 81-03, CERN, 1981.

5

W.T.Eadie, D.Drijard, F.James, M.Roos, and B.Sadoulet.
Statistical Methods in Experimental Physics.
North-Holland, 1971.

6

J. Kowalik and M.R. Osborne. Methods for unconstrained optimization problems. American Elsevier Publishing Co., Inc., New York, 1968.

7

H.H. Rosenbrock. An automatic method for finding the greatest or least value of a function, Comput. J.3, 175 (1960).

8

R. Hooke and T.A. Jeeves. Direct search solution of numerical an statistical problems. J. Assoc. Comput. Mach. 8, 212 (1961).

9

L.C.W. Dixon. Non-linear optimization. English Universities Press, London, 1972.

10

J.A. Nelder and R. Mead. A simplex method for function minimization. Comput. J. 7, 308 (1965).

11

G.W. Stewart. A modification of Davidon's method to accept difference approximations of derivatives. J. Assoc. Comput. Mach 14, 72 (1967).

12

R. Fletcher and C.M. Reeves. Function minimization by conjugate gradients. Comput. J. 7, 149 (1964).

13

M.J.D. Powell. An efficient method for finding the minimum of a function of several variables without calculating derivatives. Comput. J. 7, 155 (1964).

14

L.D. Landau and E.M. Lifshitz. The classical theory of fields. Addison-Wesley Publ. Co., Inc., Reading, Mass., 1951.

15

R. Fletcher and M.J.D. Powell. A rapidly converging descent method for minimization. Comput. J. 6, 163 (1963).

16

W.C. Davidon. Variance algorithm for minimization. Comput. J. 10, 406 (1968).

17

M.J.D. Powell. Rank one methods for unconstrained optimization, appearing in Integer and Non-linear Programming. J. Adabie, editor. North-Holland Publ. Co., Amsterdam, 1970.

18

R. Fletcher. A new approach to variable metric algorithms. Comput. J. 13, 317 (1970).

19

C.G. Broyden. Quasi-Newton methods and their application to function minimization. Math. Comput. 21, 368 (1967).

20

I.M. Gelfand and f.L. Tsetlin. The principle of non-local search in automatic optimization systems. Soviet Phys. Dokl. 6, 192 (1961).

21

A.A. Goldstein and J.F. Price. On descent from local minima. Math. Comput . 25, 569 (1971).

22

R. Fletcher. Methods for the solution of optimization problems. Comput. Phys. Commun. 3, 159 (1972).

23

M.J.D. Powell. A survey of numerical methods for unconstrained optimization. SIAM Rev. 12, 79 (1970).

24

M.J.D. Powell. A method for minimizing a sum of squares of non-linear functions without calculating derivatives. Comput. J. 7 303 (1965).

25

J. Greenstadt. On the relative efficiencies of gradient methods. Math. Comput. 21, 360 (1967) .

26

R.W.H. Sargent and B.A. Murtaugh. Computational experience with quadratically convergent minimization methods. Comput. J. 13 185 (1970).

27

A.A. Goldstein and J.F. Price. An effective algorithm for minimization. Num. Math. 10, 184 (1967).

28

P.E. Gill, W. Murray and M.H. White. Practical Optimization. Academic Press, 1981.