An efficient algorithm for solving the generalized trust region subproblem
From MaRDI portal
Publication:1655384
DOI10.1007/s40314-016-0349-1zbMath1393.90098OpenAlexW2394333194MaRDI QIDQ1655384
Publication date: 9 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0349-1
Related Items (6)
On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint ⋮ A Linear-Time Algorithm for Generalized Trust Region Subproblems ⋮ The generalized trust region subproblem: solution complexity and convex hull results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- The generalized trust region subproblem
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds
- On solving trust-region and other regularised subproblems in optimization
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Approximation algorithms for quadratic programming
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- The trust region subproblem with non-intersecting linear constraints
- Regularized total least squares based on quadratic eigenvalue problem solvers
- A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
- On the global optimality of generalized trust region subproblems
- Computing a Trust Region Step
- Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
- New Results on Quadratic Minimization
- Trust Region Methods
- Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Canonical Forms for Hermitian Matrix Pairs under Strict Equivalence and Congruence
- On Cones of Nonnegative Quadratic Functions
This page was built for publication: An efficient algorithm for solving the generalized trust region subproblem
