175
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

Sparsity in higher order methods for unconstrained optimization

&
Pages 275-294 | Received 01 Sep 2010, Accepted 10 Jun 2011, Published online: 06 Sep 2011

References

  • Bader , B. W. and Kolda , T. G. 2006 . Algorithm 862: MATLAB tensor classes for fast algorithm prototyping . ACM Trans. Math. Softw. , 32 ( 4 ) : 635 – 653 .
  • Bader , B. W. and Kolda , T. G. 2007 . Efficient MATLAB computations with sparse and factored tensors . SIAM J. Sci. Comput. , 30 ( 1 ) : 205 – 231 .
  • Barrett , R. , Berry , M. , Chan , T. F. , Demmel , J. , Donato , J. , Dongarra , J. , Eijkhout , V. , Pozo , R. , Romine , C. and Van Der Vorst , H. 1994 . Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , Philadelphia , PA : SIAM .
  • Boisvert , R. F. , Pozo , R. , Remington , K. , Barrett , R. and Dongarra , J. J. 1997 . “ The Matrix Market: A web resource for test matrix collections ” . In In Quality of Numerical Software, Assessment and Enhancement , Edited by: Boisvert , R. F. 125 – 137 . London : Chapman and Hall .
  • Chang , R.-G. , Chuang , T.-R. and Lee , J. K. 2001 . Parallel sparse supports for array intrinsic functions of Fortran 90 . J. Supercomput. , 18 ( 3 ) : 305 – 339 .
  • Conn , A. R. , Gould , N. I.M. and Toint , Ph. L. 1990 . “ An introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project ” . In Computing Methods in Applied Sciences and Engineering , Edited by: Glowinski , R. and Lichnewsky , A . 42 – 51 . Philadelphia , PA : SIAM .
  • Davis , T. A. 2005 . Algorithm 849: A concise sparse Cholesky factorization package . ACM Trans. Math. Softw. , 31 ( 4 ) : 587 – 591 .
  • Davis , T. A. 2006 . Direct Methods for Sparse Linear Systems , Philadelphia , , PA, USA : SIAM .
  • Duff , I. S. , Erisman , A. M. and Reid , J. K. 1986 . Direct Methods for Sparse Matrices , New York , NY : Clarendon Press .
  • George , A. and Liu , J. W. 1981 . Computer Solution of Large Sparse Positive Definite , Englewood Cliffs , NJ : Prentice-Hall .
  • Gilbert , J. R. , Moler , C. and Schreiber , R. 1992 . Sparse matrices in MATLAB: design and implementation . SIAM J. Matrix Anal. Appl. , 13 ( 1 ) : 333 – 356 .
  • Gundersen , G. and Steihaug , T. 2008 . Halley and Newton are on step apart . PAMM , 7 ( 1 ) : 2060011 – 2060012 .
  • Gundersen , G. and Steihaug , T. 2010 . On large scale unconstrained optimization problems and higher order methods . Optim. Meth. Softw. , 25 : 337 – 358 .
  • Gutiérrez , J. M. and Hernández , M. A. 1997 . A family of Chebyshev–Halley type methods in Banach spaces . Bull. Austral. Math. Soc. , 55 : 113 – 130 .
  • Knuth , E. E. 1997 . The Art of Computer Programming, Fundamental Algorithms , 3 , Vol. 1 , Reading , MA : Addison-Wesley .
  • Landry , W. 2003 . Implementing a high performance tensor library . Scient. Program. , 11 ( 4 ) : 273 – 290 .
  • Lin , C.-Y. , Liu , J.-S. and Chung , Y.-C. 2002 . Efficient representation scheme for multidimensional array operations . IEEE Trans. Comput , 51 ( 3 ) : 327 – 345 .
  • Lin , C.-Y. , Chung , Y.-C. and Liu , J.-S. 2003 . Efficient data compression methods for multidimensional sparse array operations based on the EKMR scheme . IEEE Trans. Comput. , 52 ( 12 ) : 1640 – 1646 .
  • Rose , D. J. 1972 . “ A graph-theoretical study of the numerical solution of sparse positive definite systems of linear equations ” . In Graph Theory and Computing , Edited by: Read , R. C. 183 – 217 . New York : Academic Press .
  • Saad , Y. 2003 . Iterative Methods for Sparse Linear Systems , Philadelphia , PA : SIAM .
  • Schwetlick , H. 1979 . “ Numerische Lösung nichtlinearer Gleichungen ” . München-Wien : R. Oldenbourg Verlag .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.