254
Views
23
CrossRef citations to date
0
Altmetric
Original Articles

On the accuracy of uniform polyhedral approximations of the copositive cone

Pages 155-173 | Received 11 Mar 2010, Accepted 07 Nov 2010, Published online: 20 Jul 2011

References

  • Berman , A. and Shaked-Monderer , N. 2003 . “ Completely Positive Matrices ” . River Edge, NJ : World Scientific .
  • Bomze , I. M. 1998 . On standard quadratic optimization problems . J. Global Optim , 13 ( 4 ) : 369 – 387 .
  • Bomze , I. M. and de Klerk , E. 2002 . Solving standard quadratic optimization problems via linear, semidefinite and copositive programming . J. Global Optim , 24 : 163 – 185 .
  • Bomze , I. M. , Dür , M. , de Klerk , E. , Roos , C. , Quist , A. and Terlaky , T. 2000 . On copositive programming and standard quadratic optimization problems . J. Global Optim , 18 ( 4 ) : 301 – 320 .
  • Bundfuss , S. and Dür , M. 2009 . An adaptive linear approximation algorithm for copositive programs . SIAM J. Optim , 20 ( 1 ) : 30 – 53 .
  • Burer , S. 2009 . On the copositive representation of binary and continuous nonconvex quadratic programs . Math. Program , 120 ( 2 ) : 479 – 495 .
  • de Klerk , E. , Laurent , M. and Parrilo , P. 2006 . A PTAS for the minimization of polynomials of fixed degree over the simplex . Theoret. Comput. Sci , 361 : 210 – 225 .
  • de Klerk , E. and Pasechnik , D. V. 2002 . Approximation of the stability number of a graph via copositive programming . SIAM J. Optim , 12 ( 4 ) : 875 – 892 .
  • Dür , M. and Still , G. 2008 . Interior points of the completely positive cone . Electron. J. Linear Algebra , 17 : 48 – 53 .
  • Håstad , J. 1999 . Clique is hard to approximate within . Acta Mathematica , 182 ( 1 ) : 105 – 142 .
  • Löfberg , J. YALMIP: A toolbox for modeling and optimization in MATLAB . Proceedings of the CACSD Conference . Taipei , Taiwan.
  • Motzkin , T. S. and Straus , E. G. 1965 . Maxima for graphs and a new proof of a theorem of Turán . Canad. J. Math , 17 : 533 – 540 .
  • Murty , K. G. and Kabadi , S. N. 1987 . Some NP-complete problems in quadratic and nonlinear programming . Math. Program , 39 ( 2 ) : 117 – 129 .
  • Parrilo , P. A. 2000 . “ Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization ” . In PhD thesis , Pasadena, CA : California Institute of Technology .
  • Peña , J. , Vera , J. and Zuluaga , L. F. 2007 . Computing the stability number of a graph via linear and semidefinite programming . SIAM J. Optim , 18 ( 1 ) : 87 – 105 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.