Accelerating the LSTRS Algorithm
From MaRDI portal
Publication:3095054
DOI10.1137/090764426zbMath1368.65096OpenAlexW2096714249MaRDI QIDQ3095054
No author found.
Publication date: 28 October 2011
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: http://resolver.tudelft.nl/uuid:bf21a632-55be-4579-be53-0f4566d08775
regularizationtrust-regionnonlinear Arnoldi methodconstrained quadratic optimizationARPACKlarge-scale trust-region subproblem (LSTRS)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20)
Related Items (13)
Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem ⋮ Globally Solving the Trust Region Subproblem Using Simple First-Order Methods ⋮ Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems ⋮ A mathematical biography of Danny C. Sorensen ⋮ Discrete ill-posed least-squares problems with a solution norm constraint ⋮ The generalized trust region subproblem ⋮ Local nonglobal minima for solving large-scale extended trust-region subproblems ⋮ Fractional regularization matrices for linear discrete ill-posed problems ⋮ Fractional Tikhonov regularization for linear discrete ill-posed problems ⋮ Solving trust-region subproblem augmented with linear inequality constraints ⋮ Error estimates for iterative algorithms for minimizing regularized quadratic subproblems ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ A method for computing a few eigenpairs of large generalized eigenvalue problems
Uses Software
This page was built for publication: Accelerating the LSTRS Algorithm
