Accelerating the LSTRS algorithm
From MaRDI portal
Recommendations
Cited in
(15)- A survey on variational characterizations for nonlinear eigenvalue problems
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- The generalized trust region subproblem
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- Discrete ill-posed least-squares problems with a solution norm constraint
- A mathematical biography of Danny C. Sorensen
- Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems
- Fractional Tikhonov regularization for linear discrete ill-posed problems
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- A faster algorithm for the computation of string convolutions using LZ78 parsing
- Solving trust-region subproblem augmented with linear inequality constraints
- Algorithm 873
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- Globally solving the trust region subproblem using simple first-order methods
- Fractional regularization matrices for linear discrete ill-posed problems
This page was built for publication: Accelerating the LSTRS algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095054)