A continuous approch for globally solving linearly constrained quadratic (Q2767579)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1697714
Language Label Description Also known as
default for all languages
No label defined
    English
    A continuous approch for globally solving linearly constrained quadratic
    scientific article; zbMATH DE number 1697714

      Statements

      A continuous approch for globally solving linearly constrained quadratic (English)
      0 references
      0 references
      0 references
      0 references
      22 April 2002
      0 references
      quadratic 0-1-programming
      0 references
      strictly concave quadratic minimization
      0 references
      0 references
      0 references
      The problem is \[ \min\bigl\{F(x)=\frac 12 x^TCx+c^Tx\mid Ax\leq b,\;x\in\{0, 1\}^n \bigr\}, \] where \(C\) is a symmetric \(n\times n\)-matrix, \(A\) is an \(m\times n\)-matrix, and the vectors \(c,x\), and \(b\) have appropriate dimensions. A new algorithm is discussed using a continuous approach of the following strictly concave quadratic minimization problem \[ \min\left\{\frac 12x^T(C-\lambda I)x+ \left( c+\frac{\lambda}{2} e\right)^Tx\mid Ax\leq b,\;x\in\{0,1\}^n \right\}, \] where \(e\) is the\(n\)-vector of ones and \(\lambda\) is a scalar defined by a special procedure.
      0 references

      Identifiers