A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem

Simple item page
dc.contributor.authorSantos, S.A.
dc.contributor.authorSorensen, D.C.
dc.date.accessioned2018-06-18T17:42:18Z
dc.date.available2018-06-18T17:42:18Z
dc.date.issued1995-07
dc.date.noteJuly 1995
dc.description.abstractThe trust region subproblem arises frequently in linear algebra and optimization applications. Recently, matrix-free methods have been introduced to solve large-scale trust-region subproblems. These methods only require a matrix-vector product and do not rely on matrix factorizations. These approaches recast the trust-region subproblem in terms of a parameterized eigenvalue problem and then adjust the parameter to find the optimal solution from the eigenvector corresponding to the smallest eigenvalue of the parameterized eigenvalue problem. This paper presents a new matrix-free algorithm for the large-scale trust-region subproblem. The new algorithm improves upon the previous algorithms by introducing a unified iteration that naturally includes the so called hard case. The new iteration is shown to be superlinearly convergent in all cases. Computational results are presented to illustrate convergence properties and robustness of the method.
dc.format.extent39 pp
dc.identifier.citationSantos, S.A. and Sorensen, D.C.. "A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem." (1995) <a href="https://hdl.handle.net/1911/101862">https://hdl.handle.net/1911/101862</a>.
dc.identifier.digitalTR95-20
dc.identifier.urihttps://hdl.handle.net/1911/101862
dc.language.isoeng
dc.relation.HasVersionsuperseded by TR99-19
dc.titleA New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR95-20.pdf
Size:
633.37 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports