IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v208y2026i1d10.1007_s10957-025-02883-2.html
   My bibliography  Save this article

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming

Author

Listed:
  • Xinyue Huo

    (LPMC, KLMDASR and LEBPS, Nankai University)

  • Ran Gu

    (LPMC, KLMDASR and LEBPS, Nankai University)

Abstract

The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization, circuit design, and other fields. The positive semidefinite penalty (PSDP) method originated from research on semidefinite relaxation, where the introduction of an exact penalty function improves the efficiency and accuracy of problem solving. In this paper, we propose a vectorized PSDP method for solving the UBQP problem, which optimizes computational efficiency by vectorizing matrix variables within a PSDP framework. Algorithmic enhancements in penalty updating and initialization are implemented, along with the introduction of two algorithms that integrate the proximal point algorithm and the projection alternating BB method for subproblem resolution. Properties of the penalty function and algorithm convergence are analyzed. Numerical experiments show the superior performance of the method in providing high-quality solutions and satisfactory solution times compared to the semidefinite relaxation method and other established methods.

Suggested Citation

  • Xinyue Huo & Ran Gu, 2026. "A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming," Journal of Optimization Theory and Applications, Springer, vol. 208(1), pages 1-31, January.
    • Handle: RePEc:spr:joptap:v:208:y:2026:i:1:d:10.1007_s10957-025-02883-2
    DOI: 10.1007/s10957-025-02883-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02883-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-025-02883-2?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    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:spr:joptap:v:208:y:2026:i:1:d:10.1007_s10957-025-02883-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.