swMATH36311MaRDI QIDQ52013FDOQ52013
Author name not available (Why is that?)
Official website: https://www.researchgate.net/publication/2263739_Solving_the_Trust-Region_Subproblem_using_the_Lanczos_Method
Cited In (90)
- An interior-point method for large constrained discrete ill-posed problems
- QPLIB: a library of quadratic programming instances
- A practical method for solving large-scale TRS
- The generalized trust region subproblem
- A survey of truncated-Newton methods
- New optimality conditions for quadratic optimization problems with binary constraints
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- Trust-region and other regularisations of linear least-squares problems
- Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix
- Error bounds of Lanczos approach for trust-region subproblem
- A new regularized quasi-Newton algorithm for unconstrained optimization
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- On efficiently combining limited-memory and trust-region techniques
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Iterative computation of negative curvature directions in large scale optimization
- An efficient algorithm for solving the generalized trust region subproblem
- Gradient descent finds the cubic-regularized nonconvex Newton step
- A modified nearly exact method for solving low-rank trust region subproblem
- On Lagrange multipliers of trust-region subproblems
- A linear-time algorithm for trust region problems
- Newton-type methods for non-convex optimization under inexact Hessian information
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive regularization with cubics on manifolds
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems
- On solving trust-region and other regularised subproblems in optimization
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- LSTRS
- QUALEX
- Filtrane
- tn
- GQTPAR
- An active-set algorithm for norm constrained quadratic problems
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- On the generalized Lanczos trust-region method
- MSS
- StratiGraph
- OPTPDE
- MINRES
- pySLEQP
- trlib
- The generalized trust region subproblem: solution complexity and convex hull results
- SEISCOPE
- SGTlight
- TuPAQ
- heapsort
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- A matrix-free line-search algorithm for nonconvex optimization
- DrAmpl: A meta solver for optimization problem analysis
- CUTEst.jl
- The trust region subproblem with non-intersecting linear constraints
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\)
- Tilt stability for quadratic programs with one or two quadratic inequality constraints
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Global convergence of SSM for minimizing a quadratic over a sphere
- SolverBenchmark.jl
- Full waveform inversion and the truncated Newton method
- A two-variable approach to the two-trust-region subproblem
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- A filter trust-region algorithm for unconstrained optimization with strong global convergence properties
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- An iterative working-set method for large-scale nonconvex quadratic programming
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Globally solving the trust region subproblem using simple first-order methods
- The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- A modified trust region method with beale's PCG technique for optimization
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- First-Order Methods for Nonconvex Quadratic Minimization
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
- A penalty-free approach to PDE constrained optimization: application to an inverse wave problem
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization
- MINPACK
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
- A block Lanczos method for the extended trust-region subproblem
- Elastic 3D-2D image registration
- Solving the cubic regularization model by a nested restarting Lanczos method
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- How much do approximate derivatives hurt filter methods?
- A Nested Lanczos Method for the Trust-Region Subproblem
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
This page was built for software: HSL-VF05
