Exactness conditions for an SDP relaxation of the extended trust region problem
type: Item
instance of: scholarly article
title: Exactness conditions for an SDP relaxation of the extended trust region problem
zbMATH Open document ID: 1353.90102
author: Marco Locatelli
published in: Optimization Letters
publication date: 2016-09-21T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 6628834
zbMATH Keywords: extended trust region problem
zbMATH Keywords: SDP relaxation
zbMATH Keywords: convex quadratic relaxation
describes a project that uses: QuadProgBB
MaRDI profile type: Publication
full work available at URL: s11590-016-1001-0
OpenAlex ID: W2282919306
cites work: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
cites work: Hidden conic quadratic representation of some nonconvex quadratic optimization problems
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems
cites work: The trust region subproblem with non-intersecting linear constraints
cites work: Globally solving nonconvex quadratic programming problems via completely positive programming
cites work: Semidefinite Relaxation Bounds for Indefinite Homogeneous Quadratic Optimization
cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
cites work: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
cites work: Some results for quadratic problems with one or two quadratic constraints
cites work: On Cones of Nonnegative Quadratic Functions
cites work: New Results on Quadratic Minimization
DOI: 10.1007/S11590-016-1001-0
description: scientific article; zbMATH DE number 6628834