论文信息 - The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches - 字舞流文

The spherical quadratic steepest descent (SQSD) method for unconstrained minimization with no explicit line searches

J. Snyman | A. Hay

[1] Singiresu S. Rao. Engineering Optimization : Theory and Practice , 2010 .

[2] David J. Thuente,et al. Line search algorithms with guaranteed sufficient decrease , 1994, TOMS.

[3] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .

[4] Jorge Nocedal,et al. Global Convergence Properties of Conjugate Gradient Methods for Optimization , 1992, SIAM J. Optim..

[5] J A Snyman. UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS , 1985 .

[6] David Mautner Himmelblau,et al. Applied Nonlinear Programming , 1972 .

[7] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..