Previous |  Up |  Next


Title: Inexact trust region method for large sparse nonlinear least squares (English)
Author: Lukšan, Ladislav
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 29
Issue: 4
Year: 1993
Pages: 305-324
Category: math
MSC: 65K05
MSC: 90C20
MSC: 90C25
idZBL: Zbl 0806.65060
idMR: MR1247880
Date available: 2009-09-24T18:41:01Z
Last updated: 2012-06-06
Stable URL:
Reference: [1] G. Golub, W. Kahan: Calculating the singular values and pseudo-inverse of a matrix.SIAM J. Numer. Anal. 2 (1965), 205-224. Zbl 0194.18201, MR 0183105
Reference: [2] J. J. More B. S. Garbow, K. E. Hillstrom: Testing unconstrained optimization software.ACM Trans. Math. Software 7 (1981), 17-41. MR 0607350
Reference: [3] J. E. Dennis, H. H. W. Mei: An Unconstrained Optimization Algorithm which Uses Function and Gradient Vlues.Report No. TR-75-246. Dept. of Computer Sci., Cornell University 1975.
Reference: [4] C. C. Paige: Bidiagonalization of matrices and solution of linear equations.SIAM J. Numer. Anal. 11 (1974), 197-209. Zbl 0244.65023, MR 0341842
Reference: [5] C. C. Paige, M. A. Saunders: LSQR: An algorithm for sparse linear equations and sparse least squares.ACM Trans. Math. Software 8 (1982), 43-71. Zbl 0478.65016, MR 0661121
Reference: [6] M. J. D. Powell: Convergence properties of a class of minimization algoritms.In: Non-linear Programming 2 (O. L. Mangasarian, R. R. Meyer and S. M. Robinson, eds.), Academic Press, London 1975. MR 0386270
Reference: [7] G. A. Shultz R. B. Schnabel, R. H. Byrd: A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties.SIAM J. Numer. Anal. 22 (1985), 47-67. MR 0772882
Reference: [8] T. Steihaug: The conjugate gradient method and trust regions in large-scale optimization.SIAM J. Numer. Anal. 20 (1983), 626-637. Zbl 0518.65042, MR 0701102


Files Size Format View
Kybernetika_29-1993-4_1.pdf 1.083Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo