IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/963563.html
   My bibliography  Save this article

A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming

Author

Listed:
  • Xuewen Mu
  • Yaling Zhang

Abstract

Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation and yields a quadratic objective function with simple quadratic constraints. A feasible direction algorithm is used to solve the nonlinear programming. The convergent analysis and time complexity of the method is given. Coupled with randomized algorithm, a suboptimal solution is obtained for the binary quadratic programming. At last, we report some numerical examples to compare our algorithm with randomized algorithm based on the interior point method and the feasible direction algorithm on max-cut problem. Simulation results have shown that our method is faster than the other two methods.

Suggested Citation

  • Xuewen Mu & Yaling Zhang, 2013. "A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-7, November.
    • Handle: RePEc:hin:jnljam:963563
    DOI: 10.1155/2013/963563
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/963563.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/JAM/2013/963563.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/963563?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnljam:963563. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.