论文信息 - A class of nonmonotone trust region algorithms for unconstrained optimization problems

A class of nonmonotone trust region algorithms for unconstrained optimization problems

A class of nonmonotone trust region algorithms is presented for unconstrained optimizations. Under suitable conditions, the global and Q-quadratic convergences of the algorithm are proved. Several rules of choosing trial steps and trust region radii are also discussed.

Jiye Han | X. Ke

[1] M. Powell. CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .

[2] Jorge J. Moré,et al. Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[3] Richard H. Byrd,et al. A Family of Trust Region Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties. , 1985 .

[4] L. Grippo,et al. A nonmonotone line search technique for Newton's method , 1986 .

[5] Â Jean-Paul Bulteau,et al. Curvilinear path and trust region in unconstrained optimization: a convergence analysis , 1987 .

[6] Richard H. Byrd,et al. Approximate solution of the trust region problem by minimization over two-dimensional subspaces , 1988, Math. Program..

[7] L. Grippo,et al. A truncated Newton method with nonmonotone line search for unconstrained optimization , 1989 .

[8] A. Tits,et al. Avoiding the Maratos effect by means of a nonmonotone line search I. general constrained problems , 1991 .

[9] N. Deng,et al. Nonmonotonic trust region algorithm , 1993 .

[10] Philippe L. Toint,et al. Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints , 1997, Math. Program..