论文信息 - On random minimization of functions

On random minimization of functions

A non-deterministic minimization algorithm recently proposed is analyzed. Some characteristics are analytically derived from the analysis of positive definite quadratic forms. An improvement is proposed and compared with the basic algorithm. Different variants of the basic algorithm are finally compared to a standard Conjugate Gradient minimization algorithm in the computation of the Rayleigh coefficient of a positive definite symmetric matrix.

Giampietro Tecchiolli | R. Brunelli

[1] F. Girosi,et al. A Nondeterministic Minimization Algorithm , 1990 .

[2] Tomaso A. Poggio,et al. Extensions of a Theory of Networks for Approximation and Learning , 1990, NIPS.

[3] William H. Press,et al. Numerical recipes in C , 2002 .

[4] G. Gambolati,et al. An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices , 1988 .

[5] Rob A. Rutenbar,et al. Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[6] Jon G. Rokne,et al. New computer methods for global optimization , 1988 .

[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[8] Norio Baba,et al. A new approach for finding the global minimum of error function of neural networks , 1989, Neural Networks.