A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
type: Item
instance of: scholarly article
title: A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
zbMATH Open document ID: 1382.90082
author: Amir Beck
author: Dror Pan
published in: Journal of Global Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6804403
zbMATH Keywords: quadratically constrained quadratic problems
zbMATH Keywords: nonconvex programming
zbMATH Keywords: branch and bound
zbMATH Keywords: sparse source localization
zbMATH Keywords: trust region subproblem
describes a project that uses: CVX
describes a project that uses: QuadProgBB
describes a project that uses: SCIP
describes a project that uses: GQTPAR
MaRDI profile type: Publication
full work available at URL: s10898-017-0521-1
OpenAlex ID: W2606666012
cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP
cites work: Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
cites work: Exact and Approximate Solutions of Source Localization Problems
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3151174
cites work: Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
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: Computing Optimal Locally Constrained Steps
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
cites work: Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
cites work: Computing a Trust Region Step
cites work: Q5491447
cites work: Newton’s Method with a Model Trust Region Modification
cites work: On Cones of Nonnegative Quadratic Functions
cites work: New Results on Quadratic Minimization
DOI: 10.1007/S10898-017-0521-1
description: scientific article; zbMATH DE number 6804403