Accelerating the LSTRS Algorithm
| dc.contributor.author | Lampe, J. | en_US |
| dc.contributor.author | Rojas, M. | en_US |
| dc.contributor.author | Sorensen, D.C. | en_US |
| dc.contributor.author | Voss, H. | en_US |
| dc.date.accessioned | 2018-06-19T17:45:08Z | en_US |
| dc.date.available | 2018-06-19T17:45:08Z | en_US |
| dc.date.issued | 2009-07 | en_US |
| dc.date.note | July 2009 | en_US |
| dc.description.abstract | In a recent paper [Rojas, Santos, Sorensen: ACM ToMS 34 (2008), Article 11] an efficient method for solvingthe Large-Scale Trust-Region Subproblem was suggested which is based on recasting it in terms of a parameter dependent eigenvalue problem and adjusting the parameter iteratively. The essential work at each iteration is the solution of an eigenvalue problem for the smallest eigenvalue of the Hessian matrix (or two smallest eigenvalues in the potential hard case) and associated eigenvector(s). Replacing the implicitly restarted Lanczos method in the original paper with the Nonlinear Arnoldi method makes it possible to recycle most of the work from previous iterations which can substantially accelerate LSTRS. | en_US |
| dc.format.extent | 11 pp | en_US |
| dc.identifier.citation | Lampe, J., Rojas, M., Sorensen, D.C., et al.. "Accelerating the LSTRS Algorithm." (2009) <a href="https://hdl.handle.net/1911/102128">https://hdl.handle.net/1911/102128</a>. | en_US |
| dc.identifier.digital | TR09-26 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1911/102128 | en_US |
| dc.language.iso | eng | en_US |
| dc.title | Accelerating the LSTRS Algorithm | en_US |
| dc.type | Technical report | en_US |
| dc.type.dcmi | Text | en_US |
Files
Original bundle
1 - 1 of 1