论文信息 - Global convergence and stabilization of unconstrained minimization methods without derivatives

Global convergence and stabilization of unconstrained minimization methods without derivatives

In this paper, acceptability criteria for the stepsize and global convergence conditions are established for unconstrained minimization methods employing only function values. On the basis of these results, the convergence of an implementable line search algorithm is proved and some global stabilization schemes are described.

L. Grippo | F. Lampariello | S. Lucidi

[1] J. F. Price,et al. An effective algorithm for minimization , 1967 .

[2] G. R. Walsh,et al. Methods Of Optimization , 1976 .

[3] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[4] Elijah Polak,et al. Computational methods in optimization , 1971 .

[5] J. J. Moré,et al. A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods , 1973 .

[6] Robert Mifflin,et al. A superlinearly convergent algorithm for minimization without evaluating derivatives , 1975, Math. Program..

[7] L. Dixon. On the Convergence of the Variable Metric Method with Numerical Derivatives and the Effect of Noise in the Function Evaluation , 1976 .

[8] Michael A. Saunders,et al. A note on a sufficient-decrease criterion for a non-derivative step-length procedure , 1982, Math. Program..

[9] Luigi Grippo,et al. Stopping criteria for linesearch methods without derivatives , 1984, Math. Program..

[10] R. Fletcher. Practical Methods of Optimization , 1988 .