Quadratic programming

Known as: QP, Quadratic program 
Quadratic programming (QP) is a special type of mathematical optimization problem—specifically, the problem of optimizing (minimizing or maximizing… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1961-2018
020040019612018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Identifying a subset of features that preserves classificat ion ccuracy is a problem of growing importance, because of the… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The problem of consistently estimating the sparsity pattern of a vector beta* isin Rp based on observations contaminated by noise… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Many problems in neural computation and statistical learning involve optimizations with nonnegativity constraints. In this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The paper considers the objective of optimally specifying redundant control effectors under constraints, a problem commonly… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The object-oriented software package OOQP for solving convex quadratic programming problems (QP) is described. The primal-dual… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Neural networks for linear and quadratic programming are analyzed. The network proposed by M.P. Kennedy and L.O. Chua (IEEE Trans… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper we present a new placement method for cellbased layout styles. It is composed of alternating and interacting global… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We show that the problem of minimizing a concave quadratic function with one concave direction is NP-hard. This result can be… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage… (More)
  • figure I
Is this relevant?