On convex relaxations for quadratically constrained quadratic programming
type: Item
instance of: scholarly article
title: On convex relaxations for quadratically constrained quadratic programming
zbMATH Open document ID: 1267.90103
author: Kurt M. Anstreicher
published in: Mathematical Programming. Series A. Series B
publication date: 2012-12-19T00:00:00Z
review text: A quadratically constrained (possibly non-convex) quadratic programming problem is considered. The efficiency, for this problem, of several known convex underestimating methods is analyzed. The underestimates, obtained by means of the considered methods, are ranked according to their tightness.
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6116941
zbMATH Keywords: quadratic programming
zbMATH Keywords: quadratic constrains
zbMATH Keywords: convex underestimate
zbMATH Keywords: reformulation-linearization
reviewed by: Antanas Žilinskas
describes a project that uses: SeDuMi
describes a project that uses: BARON
MaRDI profile type: Publication
full work available at URL: s10107-012-0602-3
OpenAlex ID: W2022026988
cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: Branch-and-bound approaches to standard quadratic optimization problems
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: On Nonconvex Quadratic Programming with Box Constraints
cites work: The MILP Road to MIQCP
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: Q3997222
cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
cites work: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: Convex Relaxations of (0, 1)-Quadratic Programming
cites work: Convex Analysis
cites work: BARON: A general purpose global optimization software package
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Global Optimization in Geometry — Circle Packing into the Square
cites work: Semidefinite Programming
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
DOI: 10.1007/S10107-012-0602-3
Recommended article: Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
Recommended article: A new convex relaxation for quadratically constrained quadratic programming
Recommended article: Convex Relaxations of (0, 1)-Quadratic Programming
Recommended article: A relaxation method for nonconvex quadratically constrained quadratic programs
Recommended article: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
Recommended article: On quadratic and complete quadratic problems of convex programming
Recommended article: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Recommended article: On linear conic relaxation of discrete quadratic programs
Recommended article: Q5045849
Recommended article: Q4963652
description: scientific article; zbMATH DE number 6116941