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…

Papers overview

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

2017

This paper examines the nonconvex quadratically constrained quadratic programming (QCQP) problems using a decomposition method…

2015

Quadratically constrained quadratic programs (QCQPs) belong to a class of nonconvex optimization problems that are NP-hard in…

2014

This paper presents a class of non-convex quadratically constrained quadratic programs that can be solved in polynomial time when…

2014

In this paper, we introduce and solve a particular generalization of the quadratically constrained quadratic programming (QCQP…

2013

A new relaxation strategy is presented in this paper to approximately solve the quadratically and linearly constrained quadratic…

2007

Abstract In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed…

2007

The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel…

2006

This paper discusses optimization problems with nonlinear inequality constraints and presents a new sequential quadratically…

1989

Quadratically constrained minimum cross-entropy problem has recently been studied by Zhang and Brockett through an elaborately…

1986

Consider a minimization problem of a convex quadratic function of several variables over a set of inequality constraints of the…