HSL-VF05

swMATH36311MaRDI QIDQ52013FDOQ52013

Author name not available (Why is that?)

Described by source

• Solving the Trust-Region Subproblem using the Lanczos Method

Cited In (73)

• Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
• A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
• An interior-point method for large constrained discrete ill-posed problems
• Full Waveform Inversion and the Truncated Newton Method
• QPLIB: a library of quadratic programming instances
• A practical method for solving large-scale TRS
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
• The generalized trust region subproblem
• A survey of truncated-Newton methods
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
• On the Generalized Lanczos Trust-Region Method
• 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
• Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
• The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem
• On efficiently combining limited-memory and trust-region techniques
• Iterative computation of negative curvature directions in large scale optimization
• An efficient algorithm for solving the generalized trust region subproblem
• 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
• Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
• trlib: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
• 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
• Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
• An active-set algorithm for norm constrained quadratic problems
• A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
• Elastic 3D-2D image registration
• The generalized trust region subproblem: solution complexity and convex hull results
• Algorithm 943
• Two globally convergent nonmonotone trust-region methods for unconstrained optimization
• A matrix-free line-search algorithm for nonconvex optimization
• DrAmpl: A meta solver for optimization problem analysis
• 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
• A two-variable approach to the two-trust-region subproblem
• An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
• On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
• A Nested Lanczos Method for the Trust-Region Subproblem
• 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
• The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint
• A modified trust region method with beale's PCG technique for optimization
• On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint
• A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
• Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
• 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
• A Block Lanczos Method for the Extended Trust-Region Subproblem
• First-Order Methods for Nonconvex Quadratic Minimization
• Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
• 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
• A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
• Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method
• How much do approximate derivatives hurt filter methods?
• Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere

This page was built for software: HSL-VF05