Conic approximation to nonconvex quadratic programming with convex quadratic constraints
type: Item
instance of: scholarly article
title: Conic approximation to nonconvex quadratic programming with convex quadratic constraints
zbMATH Open document ID: 1339.90259
author: Shu-Cherng Fang
author: Cheng Lu
author: Zhibin Deng
author: Qingwei Jin
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6419113
zbMATH Keywords: nonconvex quadratic programming
zbMATH Keywords: adaptive scheme
zbMATH Keywords: cone of nonnegative quadratic functions
describes a project that uses: NEOS
describes a project that uses: CVX
describes a project that uses: BARON
MaRDI profile type: Publication
full work available at URL: s10898-014-0195-x
OpenAlex ID: W1976931616
Wikidata QID: Q57438369
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4821526
cites work: Second-Order-Cone Constraints for Extended Trust-Region Subproblems
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: Q3681854
cites work: Trust Region Methods
cites work: Copositive realxation for genera quadratic programming
cites work: KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
cites work: Adaptive computable approximation to cones of nonnegative quadratic functions
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: State Constraints in Convex Control Problems of Bolza
cites work: BARON: A general purpose global optimization software package
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Q3802887
cites work: On Cones of Nonnegative Quadratic Functions
cites work: New Results on Quadratic Minimization
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
DOI: 10.1007/S10898-014-0195-X
description: scientific article; zbMATH DE number 6419113