On large-scale unconstrained optimization problems and higher order methods

References

• Bagirov , A. M. and Ugon , J. 2006 . Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization . J. Global Optim. , 35 : 163 – 195 .
   Web of Science ®Google Scholar
• Chen , D. , Argyros , I. K. and Qian , Q. 1994 . A local convergence theorem for the super-Halley method in a Banach space . Appl. Math. Lett. , 7 ( 5 ) : 49 – 52 .
   Web of Science ®Google Scholar
• Conn , A. R. , Gould , N. and Toint , Ph. L. 1988 . Testing a class of methods for solving minimization problems with simple bounds on the variables . Math. Comput. , 50 ( 182 ) : 399 – 430 .
   Google Scholar
• Duff , I. S. , Erisman , A. M. and Reid , J. K. 1986 . Direct Methods for Sparse Matrices , Oxford : Oxford University Press .
   Google Scholar
• Griewank , A. and Toint , Ph. L. 1982 . “ On the unconstrained optimization of partially separable functions ” . In Nonlinear Optimization , Edited by: Powell , M. J.D. 301 – 312 . New York, NY : Academic Press .
   Google Scholar
• Gundersen , G. and Steihaug , T. 2004 . “ On the use of Java arrays for sparse matrix computations. Parallel computing: Software technology, algorithms, architectures and applications ” . Vol. 13 , 119 – 126 . North-Holland/Elsevier .
   Google Scholar
• Gundersen , G. and Steihaug , T. 2006 . “ On computing with general sparse third derivatives in unconstrained optimization. I: NIK’2006, Norsk informatikkonferanse ” . 53 – 64 . Trondheim : Tapir Akademisk Forlag . ISBN 82-519-2186-4
   Google Scholar
• Gutiérrez , J. M. and Hernández , M. A. 2001 . An acceleration of Newton's method: Super-Halley method . Appl. Math. Comput. , 117 ( 2 ) : 223 – 239 .
   Google Scholar
• Halley , E. 1694 . A new, exact, and easy method of finding the roots of any equations generally, and that without any previous reduction . Philos. Trans. Roy. Soc. London , 18 : 136 – 145 .
   Google Scholar
• Knuth , D. E. 1997 . The Art of Computer Programming , 3 , Vol. 1 , Reading, MA : Fundamental Algorithms, Addison-Wesley .
   Google Scholar
• Lujan , M. , Usman , A. , Hardie , P. , Freeman , T. L. and Gurd , J. R. Storage formats for sparse matrices in Java . Proceedings of the 5th International Conference on Computational Science – ICCS 2005 . Vol. 3514 , pp. 364 – 371 . Lecture Notes in Computer Science
   Google Scholar
• Mertvecova , M. A. 1953 . Analogue of the process of tangent hyperbolas for general functional equations . Dokl. Akad. Nauk SSSR(NS) , 88 : 611 – 614 .
   Google Scholar
• Moré , J. J. , Garbow , B. S. and Hillstrom , K. E. 1981 . Testing unconstrained optimization software . ACM Trans. Math. Software , 7 : 17 – 24 .
   Web of Science ®Google Scholar
• Ne[cbreve]epuerenko , M. I. 1954 . On [Cbreve]eby[sbreve]ev's method for functional equations . Uspehi Matem. Nauk(NS) , 9 ( 2 ) : 163 – 170 .
   Google Scholar
• Schwefel , H. P. 1981 . Numerical Optimization of Computer Models , Chichester : Wiley .
   Google Scholar
• Schwetlick , H. 1979 . Numerische Lösung nichtlinearer Gleichungen , R. Oldenbourg Verlag, München, Wien .
   Google Scholar
• Toint , Ph. L. 1978 . Some numerical results using a sparse matrix updating formula in unconstrained optimization . Math. Comput. , 32 ( 143 ) : 839 – 851 .
   Google Scholar
• Werner , W. Some improvement of classical iterative methods for the solution of nonlinear equations . Proceedings of th Numerical Solution of Nonlinear Equations . Edited by: Allgower , E. L. , Glashoff , K. and Peitgen , N.-O. pp. 426 – 440 . Bremen : Springer .
   Google Scholar
• Yamamoto , T. 1988 . On the method of tangent hyperbolas in Banach spaces . J. Comput. Appl. Math. , 21 : 75 – 86 .
   Web of Science ®Google Scholar
• Yamamoto , T. 2000 . Historical developments in convergence analysis for Newton's and Newton-like methods . J. Comput. Appl. Math. , 124 : 1 – 23 .
   Web of Science ®Google Scholar