Solving the Trust-Region Subproblem using the Lanczos Method
From MaRDI portal
Recommendations
- A Nested Lanczos Method for the Trust-Region Subproblem
- On solving L-SR1 trust-region subproblems
- Error bounds of Lanczos approach for trust-region subproblem
- A block Lanczos method for the extended trust-region subproblem
- On the generalized Lanczos trust-region method
- The convergence of the generalized Lanczos trust-region method for the trust-region subproblem
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
- A Subspace Minimization Method for the Trust-Region Step
- scientific article; zbMATH DE number 1399524
Cited in
(only showing first 100 items - show all)- On Lagrange multipliers of trust-region subproblems
- Trust-region and other regularisations of linear least-squares problems
- New optimality conditions for quadratic optimization problems with binary constraints
- Newton-Krylov type algorithm for solving nonlinear least squares problems
- An interior-point method for large constrained discrete ill-posed problems
- A survey of truncated-Newton methods
- A new regularized quasi-Newton algorithm for unconstrained optimization
- An efficient algorithm for solving the generalized trust region subproblem
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- Efficient solution of quadratically constrained quadratic subproblems within the mesh adaptive direct search algorithm
- An iterative working-set method for large-scale nonconvex quadratic programming
- Efficient use of parallelism in algorithmic parameter optimization applications
- Adaptive regularization with cubics on manifolds
- An approach for robust PDE-constrained optimization with application to shape optimization of electrical engines and of dynamic elastic structures under uncertainty
- An adaptive high order method for finding third-order critical points of nonconvex optimization
- Distributed quasi-Newton derivative-free optimization method for optimization problems with multiple local optima
- An efficient PGM-based algorithm with backtracking strategy for solving quadratic optimization problems with spherical constraint
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- The generalized trust region subproblem: solution complexity and convex hull results
- A new nonmonotone adaptive trust region algorithm.
- An active-set algorithm for norm constrained quadratic problems
- Elastic 3D-2D image registration
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
- Performance enhancement of Gauss-Newton trust-region solver for distributed Gauss-Newton optimization method
- Newton-type methods for non-convex optimization under inexact Hessian information
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- QPLIB: a library of quadratic programming instances
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
- Norm-constrained least-squares solutions to the matrix equation \(A X B = C\)
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On efficiently combining limited-memory and trust-region techniques
- A modified trust region method with beale's PCG technique for optimization
- Iterative computation of negative curvature directions in large scale optimization
- The trust region subproblem with non-intersecting linear constraints
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Minimization of linear functionals defined on solutions of large-scale discrete ill-posed problems
- On a globally convergent trust region algorithm with infeasibility control for equality constrained optimization
- Two globally convergent nonmonotone trust-region methods for unconstrained optimization
- OFFO minimization algorithms for second-order optimality and their complexity
- A two-variable approach to the two-trust-region subproblem
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- A non-monotone trust region algorithm for unconstrained optimization with dynamic reference iteration updates using filter
- Parametric approach for correcting inconsistent linear equality system
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- Least-squares symmetric solution to the matrix equation AXB=C with the norm inequality constraint
- Full waveform inversion and the truncated Newton method
- Solving the trust-region subproblem by a generalized eigenvalue problem
- A linear-time algorithm for trust region problems
- On the global optimality of generalized trust region subproblems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- A Nested Lanczos Method for the Trust-Region Subproblem
- How much do approximate derivatives hurt filter methods?
- Iterative methods for finding a trust-region step
- Solving the quadratic trust-region subproblem in a low-memory BFGS framework
- A multilevel algorithm for solving the trust-region subproblem
- Behavior of DCA sequences for solving the trust-region subproblem
- Globally solving the trust region subproblem using simple first-order methods
- The generalized trust region subproblem
- A block Lanczos method for the extended trust-region subproblem
- \texttt{trlib}: a vector-free implementation of the GLTR method for iterative solution of the trust region problem
- A matrix-free line-search algorithm for nonconvex optimization
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Global convergence of SSM for minimizing a quadratic over a sphere
- The trust region subproblem and semidefinite programming*
- A nonmonotone hybrid method of conjugate gradient and Lanczos-type for solving nonlinear systems
- A penalty-free approach to PDE constrained optimization: application to an inverse wave problem
- On fast trust region methods for quadratic models with linear constraints
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- First-Order Methods for Nonconvex Quadratic Minimization
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
- Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- HSL-VF05
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- Gradient descent finds the cubic-regularized nonconvex Newton step
- Algorithm 943: MSS: MATLAB software for L-BFGS trust-region subproblems for large-scale optimization
- A second-order cone based approach for solving the trust-region subproblem and its variants
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- On the generalized Lanczos trust-region method
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- A practical method for solving large-scale TRS
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- Solving the dual subproblem of the method of moving asymptotes using a trust-region scheme
- Matrix-free algorithm for the large-scale constrained trust-region subproblem
- Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
- Krylov subspace methods for trust-region subproblem and beyond
- 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
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
- A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
- DrAmpl: A meta solver for optimization problem analysis
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem
- Solving trust region subproblems using Riemannian optimization
This page was built for publication: Solving the Trust-Region Subproblem using the Lanczos Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702297)
