Solving the trust-region subproblem by a generalized eigenvalue problem
From MaRDI portal
Recommendations
Cites work
- A constrained eigenvalue problem
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A Subspace Minimization Method for the Trust-Region Step
- Algorithm 873
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- ARPACK Users' Guide
- Computing a Trust Region Step
- Computing Optimal Locally Constrained Steps
- Functions of Matrices
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- scientific article; zbMATH DE number 3871040 (Why is no real title available?)
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Iterative methods for finding a trust-region step
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Minimizing a quadratic over a sphere
- Numerical Optimization
- Obstacle collision detection using best ellipsoid fit
- On solving trust-region and other regularised subproblems in optimization
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
- Second-order-cone constraints for extended trust-region subproblems
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving generalized CDT problems via two-parameter eigenvalues
- Solving the Trust-Region Subproblem using the Lanczos Method
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The generalized trust region subproblem
- The trust region subproblem and semidefinite programming*
- Trust Region Methods
Cited in
(62)- A semidefinite framework for trust region subproblems with applications to large scale minimization
- An efficient algorithm for solving the generalized trust region subproblem
- Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- An iterative algorithm for the conic trust region subproblem
- Integral line-of-sight path following control of magnetic helical microswimmers subject to step-out frequencies
- Error analysis for denoising smooth modulo signals on a graph
- On local nonglobal minimum of trust-region subproblem and extension
- 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
- An efficient algorithm for the extended trust-region subproblem with two linear constraints
- An active-set algorithm for norm constrained quadratic problems
- On the branch and bound algorithm for the extended trust-region subproblem
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
- QPLIB: a library of quadratic programming instances
- A Newton's method characterization for real eigenvalue problems
- Inertia laws and localization of real eigenvalues for generalized indefinite eigenvalue problems
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- A hybrid algorithm for the two-trust-region subproblem
- A new matrix-free algorithm for the large-scale trust-region subproblem
- Solving generalized CDT problems via two-parameter eigenvalues
- A linear-time algorithm for trust region problems
- Accelerating the LSTRS algorithm
- A Nested Lanczos Method for 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
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- A trust‐region method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils
- Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem
- Optimization of triangular networks with spatial constraints
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Closing the gap between necessary and sufficient conditions for local nonglobal minimizer of trust region subproblem
- Local nonglobal minima for solving large-scale extended trust-region subproblems
- On solving L-SR1 trust-region subproblems
- On high-order multilevel optimization strategies
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- Computational and sensitivity aspects of eigenvalue-based methods for the large-scale trust-region subproblem
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A practical method for solving large-scale TRS
- 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
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
- Solving trust region subproblems using Riemannian optimization
- A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- Homogeneous second-order descent framework: a fast alternative to Newton-type methods
- First-order perturbation theory of trust-region subproblem
- Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices
- Dynamic angular synchronization under smoothness constraints
- An extended sequential quadratic method with extrapolation
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- A block Lanczos method for the symmetric generalized eigenvalue complementarity problem
- A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
- Quadratic optimization with two ball constraints
This page was built for publication: Solving the trust-region subproblem by a generalized eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967610)
