References
- Cea , J. 1971 . “ Optimierung-Theorie und Algorithmen ” . In Dunod Paris
- Danilin , Y.M. and Pschenichnyi , B.N. 1970 . On methods of minimization with accelerated convergence . USSR Comp. Math. Math. Phys , 10 ( 6 )
- Dietze , S. 1975 . “ Endliche Algorithmen zur Bestimmung der Schrittweite bei Abstiegsverfahren ” . In Beiträge z. Num. Math Vol. 4 , Berlin
- Dennis , J.E. and More , J.J. 1974 . A characterization of superlinear convergence and its application to quasi-NEWTON-rnethods . Math. Comp , 28 : 549 – 560 .
- Goldstein , A.A. and Price , J.F. 1967 . An effective algorithm for minimization . Num. Math , 10 : 184 – 189 .
- Ortega , J.M. and Rheinboldt , W.C. 1970 . Iterative solution of nonlinear equations in several variables , New York : Academic Press .
- Polak , E. 1974 . A modified secant method for unconstrained minimization problems . Math. Progr , 6 : 264 – 280 .
- Schwetlick , H. Minimizing nonlinear functions by descent methods . Information Processing . Edited by: Rosenfeld , J. North-Holland Publ. Comp .
- Ritter , K. 1970 . “ A .superlinearly convergent method for unconstrained minimization problems ” . In Nonlinear Programming , Edited by: Rosen , J.B. New York : Academic Press .
- Warth , W. and Werner , J. 1977 . Schrittweitenfunktionen bei unrestringierten Optimie-rungsaufgaben . Computing , 19 : 59 – 72 .