Skip to search formSkip to main contentSkip to account menu

Quadratically constrained quadratic program

Known as: QCQP, Quadratically constrained quadratic programming 
In mathematical optimization, a quadratically constrained quadratic program (QCQP) is an optimization problem in which both the objective function… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We consider the problem of channel reconstruction in FDD networks wherein each base-station (BS) employs a transmit array… 
2018
2018
We study constrained nonconvex optimization problems in machine learning, signal processing, and stochastic control. It is well… 
2017
2017
This document describes the detailed reformulation of a power system upgrade planning problem into a more generic quadratically… 
2015
2015
The global optimisation of non-convex quadratically constrained quadratic programs is a notoriously difficult problem, being not… 
2013
2013
A new relaxation strategy is presented in this paper to approximately solve the quadratically and linearly constrained quadratic… 
2011
2011
Update summarization is to summarize a document collection B given that the users have already read another document collection A… 
2007
2007
A recursive algorithm for estimating and updating the effective carrier frequency offset (CFO) vector in a multicarrier code… 
2002
2002
This paper examines a blind adaptive implementation of a recently proposed linear minimum mean square error (LMMSE) receiver for… 
1991
1991
An interior point method for quadratically constrained convex quadratic programming is presented that is based on a logarithmic… 
1973
1973
Abstract : For a convex quadratically constrained quadratic program with n variables and m constraints it is shown using…