Zobrazeno 1 - 2
of 2
pro vyhledávání: '"D. T. M. Lau"'
Autor:
K. A. Ariyawansa, D. T. M. Lau
Publikováno v:
Optimization. 33:201-234
Collinear scaling algorithms for unconstrained minimization were first proposed by Davidon (1977,80) so that they may incorporate more information about the problem than is possible with quasi–Newton algorithms. Sorensen (1980,82), and Ariyawansa (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b4ee6f0e7c6b968fc23f2829a6e46d4
https://doi.org/10.1080/02331939508844077
https://doi.org/10.1080/02331939508844077
Autor:
K. A. Ariyawansa, D. T. M. Lau
Publikováno v:
Journal of Optimization Theory and Applications. 75:183-193
Sorensen (Ref. 1) has proposed a class of algorithms for sparse unconstrained minimization where the sparsity pattern of the Cholesky factors of the Hessian is known. His updates at each iteration depend on the choice of a vector, and in Ref. 1 the q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::731eaf3fcfd1f9803d1bbc63d990de79
https://doi.org/10.1007/bf00939911
https://doi.org/10.1007/bf00939911