Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

Nonconvex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and… Expand

Is this relevant?

2012

2012

We show that any (nonconvex) quadratically constrained quadratic program (QCQP) can be represented as a generalized copositive… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

This paper addresses the problem of generating strong convex relaxations of Mixed Integer Quadratically Constrained Programming… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

Consider a downlink communication system where multiantenna base stations transmit independent data streams to decentralized… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

This article addresses the generation of strong polyhedral relaxations for nonconvex, quadratically constrained quadratic… Expand

Is this relevant?

Highly Cited

2009

Highly Cited

2009

We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based on semidefinite programming… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Abstract.We present a branch and cut algorithm that yields in finite time, a globally ε-optimal solution (with respect to… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

We consider the problem of minimizing an indefinite quadratic objective function subject to twosided indefinite quadratic… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

In this paper, we consider the class of linearly constrained nonconvex quadratic programming problems, and present a new approach… Expand

Is this relevant?