The following pages link to LSTRS (Q16897):
Displaying 35 items.
- A mathematical biography of Danny C. Sorensen (Q413518) (← links)
- The generalized trust region subproblem (Q457202) (← links)
- On solving L-SR1 trust-region subproblems (Q513714) (← links)
- An iterative algorithm for large size least-squares constrained regularization problems (Q555485) (← links)
- Error bounds of Lanczos approach for trust-region subproblem (Q722456) (← links)
- Block relaxation and majorization methods for the nearest correlation matrix with factor structure (Q763394) (← links)
- Solving regularized total least squares problems based on eigenproblems (Q987876) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- A feasible direction method for image restoration (Q1926625) (← links)
- Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems (Q1938916) (← links)
- Minimization of functionals on the solution of a large-scale discrete ill-posed problem (Q1944012) (← links)
- An automatic and parameter-free information-based method for sparse representation in wavelet bases (Q1998046) (← links)
- A survey on variational characterizations for nonlinear eigenvalue problems (Q2055515) (← links)
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty (Q2071422) (← links)
- Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima (Q2085054) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method (Q2185999) (← links)
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems (Q2572610) (← links)
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem (Q2967610) (← links)
- P-Factor-Approach to Degenerate Optimization Problems (Q3004454) (← links)
- Accelerating the LSTRS Algorithm (Q3095054) (← links)
- A Nested Lanczos Method for the Trust-Region Subproblem (Q3174764) (← links)
- Algorithm 873 (Q3549229) (← links)
- Iterative Methods for Finding a Trust-region Step (Q3563924) (← links)
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework (Q3605193) (← links)
- <tt>trlib</tt>: a vector-free implementation of the GLTR method for iterative solution of the trust region problem (Q4637824) (← links)
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations (Q5113710) (← links)
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems (Q5210741) (← links)
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization (Q5266534) (← links)
- On the Generalized Lanczos Trust-Region Method (Q5363378) (← links)
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems (Q5373928) (← links)
- Matrix-free algorithm for the large-scale constrained trust-region subproblem (Q5478869) (← links)
- A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem (Q5502096) (← links)
- The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem (Q5857292) (← links)
- Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method (Q5863879) (← links)
