LSTRS

swMATH4729MaRDI QIDQ16897FDOQ16897

Author name not available (Why is that?)

Cited In (35)

• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
• A survey on variational characterizations for nonlinear eigenvalue problems
• The generalized trust region subproblem
• An automatic and parameter-free information-based method for sparse representation in wavelet bases
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
• A mathematical biography of Danny C. Sorensen
• An iterative algorithm for large size least-squares constrained regularization problems
• Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems
• On the Generalized Lanczos Trust-Region Method
• Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
• Error bounds of Lanczos approach for trust-region subproblem
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
• Solving the quadratic trust-region subproblem in a low-memory BFGS framework
• The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem
• Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method
• Solving regularized total least squares problems based on eigenproblems
• trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
• Accelerating the LSTRS algorithm
• Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
• Block relaxation and majorization methods for the nearest correlation matrix with factor structure
• Iterative methods for finding a trust-region step
• A feasible direction method for image restoration
• An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
• On solving L-SR1 trust-region subproblems
• A Nested Lanczos Method for the Trust-Region Subproblem
• Algorithm 873
• Minimization of functionals on the solution of a large-scale discrete ill-posed problem
• A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem
• P-factor-approach to degenerate optimization problems
• Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima
• Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
• The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
• Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
• Matrix-free algorithm for the large-scale constrained trust-region subproblem

This page was built for software: LSTRS