# Quadratically constrained quadratic program

## Papers overview

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

2017

2017

- NIPS
- 2017

We consider the problem of solving a large-scale Quadratically Constrained Quadratic Program. Such problems occur naturally in… (More)

Is this relevant?

2016

2016

- IEEE Transactions on Signal Processing
- 2016

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

Is this relevant?

Highly Cited

2015

Highly Cited

2015

- IEEE Transactions on Control of Network Systems
- 2015

This paper proves that nonconvex quadratically constrained quadratic programs can be solved in polynomial time when their… (More)

Is this relevant?

2013

2013

- IEEE Transactions on Power Systems
- 2013

In response to the challenges brought on by the energy conservation based generation dispatch (ECGD) in China, a dynamic economic… (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Math. Program.
- 2012

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

Is this relevant?

2010

2010

- ArXiv
- 2010

We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- J. Global Optimization
- 2009

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

Is this relevant?

2007

2007

- IEEE Transactions on Automatic Control
- 2007

In this note, we show that min-max model predictive control (MPC) for linearly constrained polytopic systems with quadratic cost… (More)

Is this relevant?

2004

2004

- Math. Oper. Res.
- 2004

An iteration of the sequential quadratically constrained quadratic programming method (SQCQP) consists of minimizing a quadratic… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Math. Program.
- 2000

We present a branch and cut algorithm that yields in nite time, a globally -optimal solution (with respect to feasibility and… (More)

Is this relevant?