A linear-time algorithm for the trust region subproblem based on hidden convexity
type: Item
instance of: scholarly article
title: A linear-time algorithm for the trust region subproblem based on hidden convexity
zbMATH Open document ID: 1410.90145
author: Jiulin Wang
author: Yong Xia
published in: Optimization Letters
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6819058
zbMATH Keywords: trust region subproblem
zbMATH Keywords: hidden convexity
zbMATH Keywords: proximal gradient algorithm
zbMATH Keywords: linear time complexity
describes a project that uses: HSL-VF05
describes a project that uses: GQTPAR
MaRDI profile type: Publication
full work available at URL: s11590-016-1070-0
OpenAlex ID: W2508878802
cites work: Hidden convexity in some nonconvex quadratically constrained quadratic programming
cites work: Trust Region Methods
cites work: Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
cites work: Q3359644
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: A linear-time algorithm for trust region problems
cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
cites work: Computing a Trust Region Step
cites work: Q3320132
cites work: The generalized trust region subproblem
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: Recent advances in trust region algorithms
cites work: Strong duality for generalized trust region subproblem: S-lemma with interval bounds
DOI: 10.1007/S11590-016-1070-0
description: scientific article; zbMATH DE number 6819058