D.C. Versus Copositive Bounds for Standard QP

@article{Anstreicher2005DCVC,
  title={D.C. Versus Copositive Bounds for Standard QP},
  author={Kurt M. Anstreicher and Samuel Burer},
  journal={Journal of Global Optimization},
  year={2005},
  volume={33},
  pages={299-312}
}
AbstractThe standard quadratic program (QPS) is minxεΔxTQx, where $$\Delta\subset\Re^n$$ is the simplex Δ = {x ⩽ 0 ∣ ∑i=1n xi = 1}. QPS can be used to formulate combinatorial problems such as the maximum stable set problem, and also arises in global optimization algorithms for general quadratic programming when the search space is partitioned using simplices. One class of ‘d.c.’ (for ‘difference between convex’) bounds for QPS is based on writing Q=S−T, where S and T are both positive… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

Efficient and Cheap Bounds for ( Standard ) Quadratic Optimization

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A Variational Approach to Copositive Matrices

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A new branch-and-bound algorithm for standard quadratic programming problems

VIEW 2 EXCERPTS
CITES BACKGROUND

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

VIEW 1 EXCERPT
CITES BACKGROUND

Convex optimization for cosegmentation

VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Interior-point polynomial algorithms in convex programming

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Approximation of the Stability Number of a Graph via Copositive Programming

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Branch-and-bound approaches to standard quadratic optimization problems

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

E

  • I. M. Bomze, M. Dür
  • de Klerk, C. Roos, A. Quist and T. Terlaky, On copositive programming and standard quadratic optimization problems. J. Global Optim. 18
  • 2000
VIEW 1 EXCERPT

The Sandwich Theorem

VIEW 1 EXCERPT